On Thu, Jan 04, 2001 at 01:23:30AM +0000, Paul Crowley wrote: > Peter Fairbrother <[EMAIL PROTECTED]> writes: > > Not so. Perfect compression with encryption works too. > > Er, does it? I get a 1k message from you, perfectly compressed and > then encrypted with some strong algorithm and a 128-bit key. As a > godlike being unhindered by constraints of computational power, I try > all 2^128 possible keys, and find due to the perfect compression that > each of the 2^128 plaintexts is equally likely. I think there's more that can be discovered here: Decrypt the ciphertext with each possible key, and run it through the perfect compression algorithm. If it compresses any more, then it's not the plaintext since that is already perfectly compressed. Kris
- Re: Cryptographic Algorithm Metrics Ray Dillinger
- Re: Cryptographic Algorithm Metrics Ben Laurie
- Re: Cryptographic Algorithm Metrics dmolnar
- Re: Cryptographic Algorithm Metrics John Young
- Re: Cryptographic Algorithm Metrics Greg Rose
- Re: Cryptographic Algorithm Metric... Peter Fairbrother
- Re: Cryptographic Algorithm M... Ben Laurie
- Re: Cryptographic Algorithm M... Ray Dillinger
- Re: Cryptographic Algorithm M... Paul Crowley
- Re: Cryptographic Algorit... Paul Crowley
- Re: Cryptographic Algorit... Kris Kennaway
- Re: Cryptographic Algorithm M... Arnold G. Reinhold
- Re: Cryptographic Algorithm Metric... Ben Laurie
- Re: Cryptographic Algorithm Metric... Greg Rose
- Re: Cryptographic Algorithm Metrics Paul Crowley
- Re: Cryptographic Algorithm Metrics Bill Stewart
- Re: Cryptographic Algorithm Metrics lcs Mixmaster Remailer
- Perfect compression and true randomness Nick Szabo
- Re: Perfect compression and true randomnes... Arnold G. Reinhold
- Re: Perfect compression and true rando... Paul Crowley
- Re: Perfect compression and true r... David Wagner