[2244] in cryptography@c2.net mail archive
Re: crypto on MMX
daemon@ATHENA.MIT.EDU (bill.stewart@pobox.com)
Tue Mar 3 14:03:18 1998
From: bill.stewart@pobox.com
Date: Mon, 02 Mar 1998 08:25:25 -0800
To: Amanda Walker <amanda@intercon.com>, cryptech@Mcs.Net, perry@piermont.com
Original-From: Bill Stewart <bill.stewart@pobox.com>
Cc: cryptography@c2.net
In-Reply-To: <199802262007.PAA10103@mail.intercon.com>
At 03:07 PM 2/26/98 -0500, Amanda Walker wrote:
>If we add a relatively small amount of hardware expertise, the cost
>and density plummet (and the feasibility rises correspondingly).
>Michael Weiner just published an update to his USENIX paper in
>RSA's "Cryptobytes" newsletter illustrating this. He notes that
>using today's parts, the cost of goods for a cracker with an
>expected search time of 2.5 days would be only $10K. That's about
Unfortunately, though not surprisingly, this isn't a new design;
it's only a careful application of Moore's Law, looking at how
much the gate density and speed for the appropriate categories of
ASICs, FPGAs, etc. have increased rather than merely taking 2**(Y/1.5).
Thanks!
Bill
Bill Stewart, bill.stewart@pobox.com
PGP Fingerprint D454 E202 CBC8 40BF 3C85 B884 0ABE 4639
