[10494] in cryptography@c2.net mail archive
RE: Cringely Gives KnowNow Some Unbelievable Free Press... (fwd)
daemon@ATHENA.MIT.EDU (Phillip H. Zakas)
Thu Feb 21 17:11:14 2002
From: "Phillip H. Zakas" <pzakas@toucancapital.com>
To: "'bear'" <bear@sonic.net>,
"'Eugene Leitl'" <Eugene.Leitl@lrz.uni-muenchen.de>,
<chris.williams@nativeminds.com>
Cc: "'Cryptography List'" <cryptography@wasabisystems.com>
Date: Thu, 21 Feb 2002 15:15:15 -0500
Message-ID: <000901c1bb14$7ae17320$16c89c8d@PHZ>
MIME-Version: 1.0
Content-Type: text/plain;
charset="us-ascii"
Content-Transfer-Encoding: 7bit
In-Reply-To: <Pine.LNX.4.40.0202211105161.4987-100000@newbolt.sonic.net>
> >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@wasabisystems.com
