There is a program here which sorts through various phrases and
determines the frequency of all the letters. You be able to do
something with this
http://www.cadenhead.org/book/24java/source/chapter09/Wheel.java
> Hi everyone,
>
[quoted text clipped - 10 lines]
>
> Thank you so much!
I hope you realize that only the most naive encryption methods use a
simple letter substitution scheme. Essentially every encryption method
in use today is quite different than that. For example, the encryption
of the string "aaaaa" will probably not be 5 characters long; it is more
likely to be something like "zyQ:5jnW7Wm"

Signature
Fred L. Kleinschmidt
Boeing Associate Technical Fellow
Technical Architect, Common User Interface Services
M/S 2R-94 (206)544-5225
John - 29 Apr 2005 02:42 GMT
It depends on the way the keys are handled. For example using a
symetrical encryption algorithm
using XOR can be really hard to break if only the two people
communicating are using the key and
the key is long enough. The key elements have to be applied in sequence
on the original sequence.
This means that if you have the same character on a number of positions,
chances that it will show
up with the same substitution are slim. There's really no way of
breaking the code using the method
you are trying to use.
>>Hi everyone,
>>
[quoted text clipped - 16 lines]
> of the string "aaaaa" will probably not be 5 characters long; it is more
> likely to be something like "zyQ:5jnW7Wm"