Re: Question about the Beale ciphers

From: David Florman (david.florman@worldnet.att.net)
Date: 04/15/03


From: david.florman@worldnet.att.net (David Florman)
Date: 15 Apr 2003 10:00:10 -0700


> How do you know this?

Graph the three ciphers (seperately) nos. 1 thru 1000 by qty of
occurrence. This will show modulated, mannered graphs in 1 and 3, not
so in the "broken" cipher. The most frequent nos. are well within the
densest areas of the graphs, which dwindle away nicely in the higher
no. ranges. This is not the work of a man with a keytext at one hand
and a secret message in the other, selecting a value at every letter.
It is a permutative device turning and generating nos. with distinct
mathematical properties. Graph random multiplication (1 thru 10 X 1
thru 10)mod 10. Graph ciphers 1 and 3 mod 10 (c2 as well if you
insist).This will give you complimentary sawtooth patterns which, when
added together, mimic multiplication rather well, except 0 is now 6,
and 5 is now 1. Overlap the two ciphers looking for positions where
both ciphers have a 1 or 6 in the ones' position. Look at positions
202 thru 284. This should put you on to 28 across. Everything looks
better at 28 across. Don't you think that's enough for today? You
know, we haven't even touched the modulo games, and then it's on to
additives to squares, where the ciphers really start to rock and roll.
 Dave