Factorization of RSA-140 using the number field sieveReport as inadecuate




Factorization of RSA-140 using the number field sieve - Download this document for free, or read online. Document in PDF available to download.

Presented at: 5th Annual International Conference on the Theory and Application of Cryptology and Information Security, SINGAPORE, SINGAPORE, Nov 14-18, 1999 Published in: Advances In Cryptology - Asiacrypt'99, Proceedings, p. 195-207 Series: Lecture Notes In Computer Science 1716 Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa, 1999

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.

Keywords: Large Primes Reference EPFL-CONF-164525doi:10.1007/b72231





Author: Dodson, B.; Lenstra, Arjen K.; Leyland, P.; Lioen, W.; Montgomery, P. L.; Murphy, B.; Riele, H. T.; Zimmermann, P.; Cavallar, S.

Source: https://infoscience.epfl.ch/record/164525?ln=en







Related documents