[2193] in cryptography@c2.net mail archive
Re: Efficient DES Key Search
daemon@ATHENA.MIT.EDU (Steven M. Bellovin)
Thu Feb 26 00:12:16 1998
Date: Thu, 26 Feb 1998 03:53:02 +0000
To: Dan.Oelke@aud.alcatel.com (Daniel R. Oelke)
From: "Steven M. Bellovin" <smb@research.att.com>
Cc: cryptography@c2.net
In-Reply-To: <199802260116.TAA03382@spirit.aud.alcatel.com>
At 07:16 PM 2/25/98 -0600, Daniel R. Oelke wrote:
>Now, if you could fit it in an FPGA - then it would be cheap.
>This would put it in the realm of people who will do things just
>to make a point. A couple of people could each buy their
>own FPGA and seriously boost their ranking at distributed.net
>
We don't really need to produce all that many. What's necessary is a speed
demo by *one* chip, plus obvious circuits to let you stack them. The
arguments raised against the original Diffie-Hellman DES-cracker design
were probably bogus even then -- MTBF, power, etc. -- but they're obviously
false now.
