From: Thomas Koenig <ig25@mvmap66.ciw.uni-karlsruhe.de>
To: challenge <challenge@list.ee.ethz.ch>
Message Hash: 134b4c50d940a70c40a11955a3d109fec6cfbaf9bf8ef141266a5b19160f9c42
Message ID: <199702111427.GAA19940@toad.com>
Reply To: N/A
UTC Datetime: 1997-02-11 14:27:05 UTC
Raw Date: Tue, 11 Feb 1997 06:27:05 -0800 (PST)
From: Thomas Koenig <ig25@mvmap66.ciw.uni-karlsruhe.de>
Date: Tue, 11 Feb 1997 06:27:05 -0800 (PST)
To: challenge <challenge@list.ee.ethz.ch>
Subject: What's next?
Message-ID: <199702111427.GAA19940@toad.com>
MIME-Version: 1.0
Content-Type: text/plain
Now that we appear to be at a sustainable 300 MK/sec (which I could
hardly believe at first :-), is there any chance we could be attacking
the 56-bit DES key next?
DES is rumoured to be faster than RC5; also, there are likely to
be optimized assembler versions out there already.
We could also make better use of 64-bit architectures, since DES
uses 64-bit blocks.
However (and this is a very big however), that's still a keyspace of
7.2*10^16 keys to search. Assuming 10^9 keys/second (three times our
current speed, which may be attainable with a good DES implementation)
that's still a bit over two years; too long by a factor of 10 or so.
Soo....
How fast are current DES implementations? People could try des.c from
the ssh distribution as a starting point.
How much more computing power could we bring online?
Do people have optimized DES for Alpha, UltraSparc, HP 8000 and all
the other nifty 64-bit architectures?
Does it make sense to use MMX or equivalent for DES?
--
Thomas Koenig, Thomas.Koenig@ciw.uni-karlsruhe.de, ig25@dkauni2.bitnet.
The joy of engineering is to find a straight line on a double
logarithmic diagram.
Return to February 1997
Return to “Thomas Koenig <ig25@mvmap66.ciw.uni-karlsruhe.de>”
1997-02-11 (Tue, 11 Feb 1997 06:27:05 -0800 (PST)) - What’s next? - Thomas Koenig <ig25@mvmap66.ciw.uni-karlsruhe.de>