[1150] in cryptography@c2.net mail archive
Re: Better DES challenge update
daemon@ATHENA.MIT.EDU (Andreas Bogk)
Wed Jul 2 16:32:21 1997
To: Paul Bradley <paul@fatmans.demon.co.uk>
Cc: Matt Blaze <mab@crypto.com>, Eli Brandt <eli@gs160.sp.cs.cmu.edu>,
cryptography@c2.net
From: Andreas Bogk <andreas@artcom.de>
Date: 02 Jul 1997 22:02:03 +0200
In-Reply-To: Paul Bradley's message of Wed, 2 Jul 1997 17:02:25 +0000 ( )
>>>>> "Paul" == Paul Bradley <paul@fatmans.demon.co.uk> writes:
Paul> I have to admit ignorance in terms of the uses of FPGAs in
Paul> other cryptanalytic tasks: Would an FPGA be significantly
Paul> faster than general purpose hardware for a factoring attack?
Paul> How about finding discrete logs?
I'm afraid a general purpose (massively-parallel) computer is better
suited for those problems, as they require complex, memory-intense
calculations.
Andreas
--
Get rid of C++ and yourself a Dylan compiler at legend.gwydion.cs.cmu.edu!
