// COMPLETE THREAD

Cypher secure versus computationally unbounded adversary

3 expanded posts · every known parent and child

NODE 6d4f6a55Cypher secure versus computationally unbounded adversary solman@MIT.EDUSun, 3 Dec 1995 03:48:06 +0800

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

NODE c7857438Re: Cypher secure versus computationally unbounded adversary solman@MIT.EDUSun, 3 Dec 1995 03:52:21 +0800

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

NODE 3faad109Re: Cypher secure versus computationally unbounded adversary SINCLAIR DOUGLAS N <sinclai@ecf.toronto.edu>Sun, 3 Dec 95 06:10:26 PST

> 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

That is certainly new.  Infact, I think there are proofs that say you 
can't do it.  I'm positive you can't do it if the plaintext does not
have maximum entropy.  So, tell us your scheme.