Re: VMs: A cryptological assault on Strong's decryption...

[Elmar Vogt <elvogt@xxxxxxxxxxx>]

Nick Pelling wrote:
> ...
> Elmar, is this sufficient detail for you?

Thanks for the summary!

Lemme see...

In a nutshell: You prepare a number of subtitution alphabets, calling them 
"1", "3", "5" etc. For every word, I encode my letters according to the 
current alphabet. At every half-space, I proceed to use the next alphabet in 
the "135797531474" sequence.

(I'm not quite sure if "1", "3", "5" etc. are supposed to be randomly 
scrambled substitution ciphers, or if it's supposed to be a regular 
subsitution of "move 1/3/5 ... characters forward in the alphabet to reach 
the corresponding code letter from the plaintext letter." -- And wouldn't 
the latter be equivalent to a Vigenere cipher?)

In any case... I'd expect such a system to arrive at a much more uniform and 
pseudo-random ciphertext than we actually observe. Not to mention the 
sequences of similar and identical words.

Cheers,

	E.

--
Elmar Vogt / Königswarterstr. 18 / 90762 Fürth / GERMANY
elvogt@xxxxxxxxxxx / Tel.: (++49/0)911 - 31 52 58
Agilmar v. Sevelingen: AGE PERDITUS, FAC ME DIES (Haroldus Sordidus)

"It is through the truthful exercising of the best of human qualities -
respect for others, honesty about ourselves, faith in our ideals - that
we come to life in God's eyes." (Bruce Springsteen, "Vote for Change")

______________________________________________________________________
To unsubscribe, send mail to majordomo@xxxxxxxxxxx with a body saying:
unsubscribe vms-list