🚀 go-pugleaf

The idea that the set of possible plaintext messages is small relative to the
set of possible messages is not always valid.  How about the encryption of
binary object codes or the vectorized files of the plans of a classified
mechanical device?  A good cryptographer must assume that any possible message
has a chance of eventually appearing for encryption.

So long as the encryption process is one-to-one between the spaces of possible
plaintext messages and cyphertext messages, then "nonrandom" (whatever that
means!) messages are encrypted into "rnadom" messages just as often as the
"random" ones are encrypted into "nonrandom" ones.  What *is* rare, so long as
the nonrandom messages are a smaller space than the space of all messages, is
the event in which a "nonrandom" message is encrypted into a "nonrandom"
message.  There are exceptions:  remember what the Germans thought of Navajo?

Truett Lee Smith, Sunnyvale, CA
UUCP:  truett@cup.portal.com