[44559] in Cypherpunks
Re: Cypher secure versus computationally unbounded adversary
daemon@ATHENA.MIT.EDU (SINCLAIR DOUGLAS N)
Sun Dec 3 09:16:44 1995
From: SINCLAIR DOUGLAS N <sinclai@ecf.toronto.edu>
To: solman@MIT.EDU
Date: Sun, 3 Dec 1995 09:10:37 -0500
Cc: cypherpunks@toad.com
In-Reply-To: <9512021931.AA01944@ua.MIT.EDU> from "solman@MIT.EDU" at Dec 2, 95 02:31:48 pm
> 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.
