[16057] in cryptography@c2.net mail archive
Re: Compression theory reference?
daemon@ATHENA.MIT.EDU (Matt Crawford)
Wed Sep 1 08:40:30 2004
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Tue, 31 Aug 2004 17:07:30 -0500
From: Matt Crawford <crawdad@fnal.gov>
In-reply-to: <4134E5F9.8040200@av8n.com>
To: John Denker <jsd@av8n.com>
Cc: Hadmut Danisch <hadmut@danisch.de>, cryptography@metzdowd.com
On Aug 31, 2004, at 15:56, John Denker wrote:
> 4) Don't forget the _recursion_ argument. Take their favorite
> algorithm (call it XX). If their claims are correct, XX should
> be able to compress _anything_. That is, the output of XX
> should _always_ be at least one bit shorter than the input.
> Then the compound operation XX(XX(...)) should produce something
> two bits shorter than the original input. If you start with a
> N-bit message and apply the XX function N-1 times, you should be
> able to compress each and every message down to a single bit.
Plus a string of log(N) bits telling you how many times to apply the
decompression function!
Uh-oh, now goes over the judge's head ...
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
