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

[bear]

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
>asymptotic cost.  His conclusion, recently detailed in a paper, should
>be a bombshell, but apparently everyone is asleep:
>
>DB:
>>This reduction of total cost [...] means that a [approx 3d-digit]
>>factorization with the new machine has the same cost as a d-digit
>>factorization with previous machines.
>
>Knowledge is pretty fuzzy about its runtime and practicality, but it
>means that it may well be much easier than previously believed to
>break 1024 bits.  You may need, say, 3000 bits to be safe.


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 Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo at wasabisystems.com