Bernstein's NFS machine

[jamesd at echeque.com]

    --
On Tue, Feb 26, 2002 at 02:04:16AM -0000, Frog3 wrote:
> The cost [To factor RSA 1024] is the need to build a 
> machine that can do 53 billion simultaneous, independent 
> ECM factorizations for smoothness testing. It's not clear 
> how amenable this would be to hardware implementation.
>
> A time of 2^71 is considerably less threatening than 2^53.

If I understand frog3's numbers correctly:

If one builds extraordinarily massive hardware capable of
dowing 53 billion simultaneous independent ECM
factorizations, Bernstein's method wil take 2^71 steps.

Assuming that the massively parallel hardware does fifty
billion factorizations each microsecond, then it will take 
Bernstein's super duper hardware about one hundred million
years to factor an RSA 1024 modulus. 

    --digsig
         James A. Donald
     6YeGpsZR+nOTh/cGwvITnSR3TdzclVpR0+pr3YYQdkG
     gUmxdOcDwV+bYp6vLC5uQ9yIX5x1ATUduCoSVKSp
     41JzVZfVEa6rS0tZag9ORqrngDwyHIZYriUomT6+w


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