[44491] in Cypherpunks

home help back first fref pref prev next nref lref last post

Re: Cypher secure versus computationally unbounded adversary

daemon@ATHENA.MIT.EDU (solman@MIT.EDU)
Sat Dec 2 14:40:50 1995

From: solman@MIT.EDU
To: solman@MIT.EDU
Cc: cypherpunks@toad.com
In-Reply-To: Your message of "Sat, 02 Dec 1995 14:31:48 EST."
             <9512021931.AA01944@ua.MIT.EDU> 
Date: Sat, 02 Dec 1995 14:35:58 EST

What I meant to say, was that the encryption protocol is secure versus
a computationally unbounded passive adversary AND REQUIRES NO PRIOR
COMMUNICATION.

Sorry 'bout that,

Jason W. Solinsky

home help back first fref pref prev next nref lref last post