Re: Cypher secure versus computationally unbounded adversary

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.