Cypher secure versus computationally unbounded adversary

solman at MIT.EDU solman at MIT.EDU
Sat Dec 2 11:48:06 PST 1995


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






More information about the cypherpunks-legacy mailing list