Factorization of RSA-140 using the number field sieve

On February 2, 1999, we completed the factorization of the 140-digit number RSA-140 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 130-digit number RSA-130, also with the help of NFS. The amount of computing time spent on RSA-140 was roughly twice that needed for RSA-130, about half of what could be expected from a straightforward extrapolation of the computing time spent on factoring RSA-130. The speed-up can be attributed to a new polynomial selection method for NFS which will be sketched in this paper.


Published in:
Advances In Cryptology - Asiacrypt'99, Proceedings, 195-207
Presented at:
5th Annual International Conference on the Theory and Application of Cryptology and Information Security, SINGAPORE, SINGAPORE, Nov 14-18, 1999
Year:
1999
Publisher:
Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa
Keywords:
Laboratories:




 Record created 2011-03-29, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)