[40334] in cryptography@c2.net mail archive
Re: Debunking the PGP backdoor myth for good.
daemon@ATHENA.MIT.EDU (Perry E. Metzger)
Sun Sep 3 23:43:20 2006
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
To: "Ondrej Mikle" <ondrej.mikle@gmail.com>
Cc: cryptography@metzdowd.com
From: "Perry E. Metzger" <perry@piermont.com>
Date: Wed, 30 Aug 2006 10:35:58 -0400
In-Reply-To: <98714e1d0608280729ve6fbd3aj8245c59c76e8ff5b@mail.gmail.com> (Ondrej
Mikle's message of "Mon, 28 Aug 2006 16:29:51 +0200")
"Ondrej Mikle" <ondrej.mikle@gmail.com> writes:
> I conjecture that for every permutation on 1..N there exists a
> function that compresses the permutation into a "short"
> representation.
Provably false, indeed, trivially proven false.
In other messages you back off and say you just meant some kinds of
structured data can be compressed. Well, yes, but so what? We know
that already.
Perry
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
