2000
Factorization of a 512bit RSA modulus
Publication
Publication
On August 22, 1999, we completed the factorization of the 512bit 155digit number RSA155 with the help of the Number Field Sieve factoring method (NFS). This is a new record for factoring general numbers. Moreover, 512bit RSA keys are frequently used for the protection of electronic commerceat least outside the USAso this factorization represents a breakthrough in research on RSAbased systems. The previous record, factoring the 140digit number RSA140, was established on February 2, 1999, also with the help of NFS, by a subset of the team which factored RSA155. The amount of computing time spent on RSA155 was about 8400 MIPS years, roughly four times that needed for RSA140; this is about half of what could be expected from a straightforward extrapolation of the computing time spent on factoring RSA140 and about a quarter of what would be expected from a straightforward extrapolation of the computing time spent on RSA130. The speedup is due to a new polynomial selection method for NFS of Murphy and Montgomery which was applied for the first time to RSA140 and now, with improvements, to RSA155.
Additional Metadata  

,  
,  
CWI  
Modelling, Analysis and Simulation [MAS]  
Organisation  Scientific Computing 
Cavallar, S.H, Lioen, W.M, te Riele, H.J.J, Dodson, B, Lenstra, A.K, Montgomery, P.L, & Murphy, B. (2000). Factorization of a 512bit RSA modulus. Modelling, Analysis and Simulation [MAS]. CWI.

See Also 

inProceedings

inProceedings
