Re: Cryptographic Algorithm Metrics

[Arnold G. Reinhold]

At 10:38 PM +0000 1/3/2001, Peter Fairbrother wrote:
>on 3/1/01 9:25 pm, Greg Rose at [EMAIL PROTECTED] wrote:
>
> > At Crypto a
>> couple of years ago the invited lecture gave some very general results
>> about unconditionally secure ciphers... unfortunately I can't remember
>> exactly who gave the lecture, but I think it might have been Oded
>> Goldreich... forgive me if I'm wrong. The important result, though, was
>> that you need truly random input to the algorithm in an amount equal to the
>> stuff being protected, or you cannot have unconditional security.
>
>Not so. Perfect compression with encryption works too.
>

How does perfect compression prevent a known plaintext attack?


Arnold Reinhold


PS I am also curious why Mr. Smith considers 1024-bit RSA to be 
"Conditionally Computationally Secure."