> -----Original Message----- > From: bear [mailto:[EMAIL PROTECTED]] > Sent: Monday, February 25, 2002 2:49 PM > > On Thu, 21 Feb 2002, Phillip H. Zakas wrote: > > >> >On Tue, 5 Feb 2002, Eugene Leitl wrote: > > >> >But at Crypto last August, Dan Bernstein announced a new design for a > >> >machine dedicated to NFS using asymptotically fast algorithms and > >> >optimising memory, CPU power and amount of parallelism to minimize > >> > > Bear Responds: > >> I really want to read this paper; if we don't get to see the > >> actual mathematics, claims like this look incredibly like > >> someone is spreading FUD. Is it available anywhere? > >> > > > >The paper is located here: http://cr.yp.to/papers.html > >I've not evaluated yet but I'm interested in hearing if he received his > >grant to try it out. > > Holy shit. The math works. Bernstein has found ways of > using additional hardware to eliminate redundancies and > inefficiencies which appear in any linear implementation of the > Number Field Sieve. We just never noticed that they were > inefficiencies and redundancies because we kept thinking in > terms of linear implementations. This is probably the biggest > news in crypto in the last decade. I'm astonished that it > hasn't been louder.
It does seem doable and for not very much money. Is anyone attending the Intl. Financial Cryptography Association meeting in Bermuda from March 11-15th? Perhaps we could arrange an informal get-together for this list. Phillip --------------------------------------------------------------------- The Cryptography Mailing List Unsubscribe by sending "unsubscribe cryptography" to [EMAIL PROTECTED]
