[44489] in Cypherpunks
Cypher secure versus computationally unbounded adversary
daemon@ATHENA.MIT.EDU (solman@MIT.EDU)
Sat Dec 2 14:35:02 1995
From: solman@MIT.EDU
To: cypherpunks@toad.com
Cc: solman@MIT.EDU
Date: Sat, 02 Dec 1995 14:31:48 EST
Hi all,
I've just come up with a method for implementing and encryption algorithm
that is absolutely secure from passive attacks by a computationally
unbounded adversary. Is this a new capability, or am I reinventing the
wheel here?
Thanks,
Jason W. Solinsky
