[107656] in Cypherpunks
Vernam encryption again
daemon@ATHENA.MIT.EDU (bill payne)
Wed Jan 20 13:26:46 1999
Date: Wed, 20 Jan 1999 10:41:55 -0700
From: bill payne <billp@nmol.com>
To: jy@jya.com, j orlin grabbe <kalliste@aci.net>, softwar@us.net,
lawya@lucs-01.novell.leeds.ac.uk, senator_hatch@Hatch.senate.gov,
senator@thurmond.senate.gov, chuck_grassley@grassley.senate.gov,
senator_specter@specter.senate.gov,
senator_thompson@thompson.senate.gov, info@kyl.senate.gov,
senator_dewine@dewine.senate.gov, john_ashcroft@ashcroft.senate.gov,
michigan@abraham.senate.gov, senator_leahy@leahy.senate.gov,
senator@kennedy.senate.gov, senator@biden.senate.gov,
senator_kohl@kohl.senate.gov, senator@feinstein.senate.gov,
russell_feingold@feingold.senate.gov, dick@durbin.senate.gov,
senator@torricelli.senate.gov
CC: tyler przybylek <cprzybylek@doeal.gov>, mok-kong.shen@stud.uni-muenchen.de,
cypherpunks@toad.com, ukcrypto@maillist.ox.ac.uk
Reply-To: bill payne <billp@nmol.com>
Wednesday 1/20/99 10:24 AM
J Orlin Grabbe http://www.aci.net/kalliste/
John Young http://www.jya.com/index.htm
Charles R Smith http://www.us.net/softwar/
http://jya.com/shen-cipher.htm is a fun position electronic paper.
Show how to defeat unintelligent government rules.
---
4. Combining two text streams through:
a. Bitwise XOR.
b. Addition mod 2^32 (assuming 32 bit word length).
---
Shen wrote,
Note that with (4) an arbitrary number of text streams can be
combined ...
Yes.
In order to identify a winning algorithm, the algorithm must excel
others with positive properties.
1 Deniability
2 simplicity
3 faster
4 cheaper
5 ...
There has to be OBJECTIVE CRITERIA that an algorithm must satisfy to be
adopted.
Complexity doesn't have it. One can alway make something more complex.
Vernam clobbered the competition in about 1918.
http://www.softwar.net/hist.html Case closed.
There still other interesting problems to solve.
Like the crooked judges and clerks problem.
http://nmol.com/users/billp/INDEX.HTM
Later
bill
