1999
Factorization of RSA140 using the number field sieve
Publication
Publication
On February 2, 1999, we completed the factorization of the 140digit number RSA140 with the help of the Number Field Sieve factoring method (NFS). This is a new general factoring record. The previous record was established on April 10, 1996 by the factorization of the 130digit number RSA130, also with the help of NFS. The amount of computing time spent on RSA140 was roughly twice that needed for RSA130, about half of what could be expected from a straightforward extrapolation of the computing time spent on factoring RSA130. The speedup can be attributed to a new polynomial selection method for NFS which will be sketched in this paper. par The implications of the new polynomial selection method for factoring a 512bit RSA modulus are discussed and it is concluded that 512bit (= 155digit) RSA moduli are easily and realistically within reach of factoring efforts similar to the one presented here.
Additional Metadata  

Numerical Algorithms and Problems (acm F.2.1)  
Factorization (msc 11Y05), Factorization; primality (msc 11A51)  
Life Sciences (theme 5), Energy (theme 4)  
CWI  
Modelling, Analysis and Simulation [MAS]  
Organisation  Scientific Computing 
Cavallar, S.H, Dodson, B, Lenstra, A.K, Leyland, P.C, Lioen, W.M, Montgomery, P.L, … Zimmermann, P. (1999). Factorization of RSA140 using the number field sieve. Modelling, Analysis and Simulation [MAS]. CWI.

See Also 

inProceedings

inProceedings
