cryptoanarchy.wiki

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

1996-07-23 - Re: Brute Force DES

Header Data

From: Kevin L Prigge <Kevin.L.Prigge-2@tc.umn.edu>
To: perry@piermont.com
Message Hash: c95733f1706c8aac9f749f7b1fe3279cdb9489ac5852c607b0e39ad7db104f8b
Message ID: <31f4f77f1947002@noc.tc.umn.edu>
Reply To: <199607231338.JAA15819@jekyll.piermont.com>
UTC Datetime: 1996-07-23 20:20:15 UTC
Raw Date: Wed, 24 Jul 1996 04:20:15 +0800

Raw message

From: Kevin L Prigge <Kevin.L.Prigge-2@tc.umn.edu>
Date: Wed, 24 Jul 1996 04:20:15 +0800
To: perry@piermont.com
Subject: Re: Brute Force DES
In-Reply-To: <199607231338.JAA15819@jekyll.piermont.com>
Message-ID: <31f4f77f1947002@noc.tc.umn.edu>
MIME-Version: 1.0
Content-Type: text/plain


Perry E. Metzger said:
> 
> "Peter Trei" writes:
> > The fastest general purpose, freely available des implementation I'm
> > aware of is libdes. by Eric Young. With this, I can do a set_key in 
> > 15.8 us, and an ecb_encrypt in 95 us/block. That adds up to 
> > about 9,000 keytests/sec (this is on a 90 MHz P5, running NT).
> 
> I'll point out that like most DES implementations, Eric's tries to
> spend a lot of time in key setup to save time later on in
> encryption/decryption. This tradeoff would probably be very different
> if you didn't plan on trying more than one or two blocks of decryption
> after getting a key.
> 

For instance if you had a DES encrypted gzipped file. The first 2 bytes
plaintext will be Ox1f8b. You'd only have to try to fully decrypt 
1 out of 65535 keys.

-- 
Kevin L. Prigge                     | "I rarely saw people sitting at
Systems Software Programmer         |  computers producing real code
Internet Enterprise - OIT           |  wearing ties." - Philippe Kahn
University of Minnesota             | (speech at Software Development '90)

Thread