Cringely Gives KnowNow Some Unbelievable Free Press... (fwd)

[Phillip H. Zakas]

> >On Tue, 5 Feb 2002, Eugene Leitl wrote:
> >Things have been quiet on the "new algorithms" front for a few years.
> >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?
> 
> 				Ray

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.
Phillip


---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo at wasabisystems.com