Factorization of RSA-140 Using the Number Field Sieve. Modelling, Analysis and211 Simulation (MAS)

摘要

On February 2, 1999, we completed the factorization of the 140-digit number of211u001eRSA-140 with the help of the Number Field Sieve factoring method (NFS). This is a 211u001enew general factoring record. The previous record was established by the 211u001efactorization of the 130-digit number RSA-130, also with the help of NFS. The 211u001eamount of computing time spent on RSA-140 was roughly twice that needed for RSA-211u001e130, about half of what could be expected from a straightforward extrapolation of 211u001ethe computing time spent on factoring RSA-130. The speed-up can be attributed to 211u001ea new polynomial selection method for NFS which will be sketched in this paper.