James suggests: " Write a block cipher that enciphers 0, 1, ..., n. Pick a random key. Encipher 0, 1, ..., n.
You need not devise a new cipher; just use Hasty Pudding. From http://richard.schroeppel.name/hpc/ " The arbitrary block size means that anything can be encrypted without expansion. Arbitrary sets, such as dates, or the printable subset of ascii, or the 20-bit primes, can be encrypted to themselves. On Fri, May 10, 2013 at 8:15 AM, Dean, James <[email protected]> wrote: > Write a block cipher that enciphers 0, 1, ..., n. Pick a random key. > Encipher 0, 1, ..., n. The cipher will have tables but hopefully much > smaller than n in length. > > _______________________________________________ > cryptography mailing list > [email protected] > http://lists.randombit.net/mailman/listinfo/cryptography > -- Who put a stop payment on my reality check?
_______________________________________________ cryptography mailing list [email protected] http://lists.randombit.net/mailman/listinfo/cryptography
