cryptoanarchy.wiki

Arise, you have nothing to lose but your barbed wire fences!

1994-07-17 - Re: Triple encryption…

Header Data

From: Berzerk <berzerk@xmission.xmission.com>
To: N/A
Message Hash: 6d2a7073e57ae52fa55d9dbfd26ad08872bca76fa5b29becdb2a63f12e65a615
Message ID: <Pine.3.89.9407171121.A18968-0100000@xmission>
Reply To: <9407171652.AA12181@tis.com>
UTC Datetime: 1994-07-17 18:02:52 UTC
Raw Date: Sun, 17 Jul 94 11:02:52 PDT

Raw message

From: Berzerk <berzerk@xmission.xmission.com>
Date: Sun, 17 Jul 94 11:02:52 PDT
Subject: Re: Triple encryption...
In-Reply-To: <9407171652.AA12181@tis.com>
Message-ID: <Pine.3.89.9407171121.A18968-0100000@xmission>
MIME-Version: 1.0
Content-Type: text/plain




On Sun, 17 Jul 1994, Carl Ellison wrote:
> where that leads me.  If there were such attacks, they would rely on
> information about the key leaking into the ciphertext, independent of the
> plaintext.  It might be possible to prove that any key-driven permutation
This is bogus.  No symetric algorithim has this characteristic, in fact, 
the 1 on 1 nature of the algorithim precludes this as the total ammount 
of information is equal to the information in the plaintext.  The proof 
is simple enumeration.

Roger.

Thread