[8377] in cryptography@c2.net mail archive
Re: Cryptographic Algorithm Metrics
daemon@ATHENA.MIT.EDU (Ray Dillinger)
Wed Jan 3 19:33:40 2001
Date: Wed, 3 Jan 2001 16:31:08 -0800 (PST)
From: Ray Dillinger <bear@sonic.net>
To: Peter Fairbrother <peter.fairbrother@ntlworld.com>
Cc: cryptography@c2.net
In-Reply-To: <B6795A48.48E5%peter.fairbrother@ntlworld.com>
Message-ID: <Pine.LNX.4.21.0101031629250.8832-100000@bolt.sonic.net>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
On Wed, 3 Jan 2001, Peter Fairbrother wrote:
>on 3/1/01 9:25 pm, Greg Rose at ggr@qualcomm.com wrote:
>> 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.
Sure it does. Let us know when you figure out how to
do Perfect Compression.
Bear
