1993-06-18 - fast des

Header Data

From: Eric Hughes <hughes@soda.berkeley.edu>
To: cypherpunks@toad.com
Message Hash: 6a70b040f7663e366ab73bffc67ed27944fb42c34fc96ffaf7ee5227922cc463
Message ID: <9306180102.AA26143@soda.berkeley.edu>
Reply To: <9306172113.AA10922@jazz.hal.com>
UTC Datetime: 1993-06-18 01:06:27 UTC
Raw Date: Thu, 17 Jun 93 18:06:27 PDT

Raw message

From: Eric Hughes <hughes@soda.berkeley.edu>
Date: Thu, 17 Jun 93 18:06:27 PDT
To: cypherpunks@toad.com
Subject: fast des
In-Reply-To: <9306172113.AA10922@jazz.hal.com>
Message-ID: <9306180102.AA26143@soda.berkeley.edu>
MIME-Version: 1.0
Content-Type: text/plain


> Compression will screw up character frequencies [...] enough to make
>automated detection of a successfully-broken encryption really darn
>hard.

The question is just how hard is "really darn hard"?

Compressed English text has characteristic patterns just as plain
English does.  The salient difference is that these patterns take
longer to emerge at the same confidence level.  The compressibility
limit is a limit not usually reached; the difference between that
limit and the actual compressed text will be non-zero.  This
difference manifests itself in patterns in the compressed text.

Some estimates of this size are necessary in order that the designer
have an assurance that automatic recognition of decrypted text is
difficult.

These concerns are largely obviated by using ciphers with longer key
lengths, of course.

Eric





Thread