News and advice on data security and cryptography The Factorization of RSA-140
Download:
by Rsa Laboratories, Scott Contini, Peter L. Montgomery, Stefania Cavallar, Herman J. J. Te Riele, Walter M. Lioen, Paul C. Leyl, Bruce Dodson, Paul Zimmerman, Arjen K. Lenstra
ftp://ftp.rsa.com/pub/pdfs/bulletn10.pdf
Add To MetaCart
Abstract:
As is well known, the security of the RSA cryptosystem [3] and the difficulty of factoring are closely related. To help track progress in factoring technology and to promote interest in factoring as a research problem, RSA Data Security sponsors the RSA Factoring Challenge with financial prizes being awarded to successful factorers. On February 2, 1999, the factorization of RSA-140 was completed using the general number field sieve factoring algorithm (GNFS). RSA-140 is a 140-digit number of the form used for RSA moduli and it was the smallest unfactored RSA-number in the factoring challenge. Its factorization is the largest factorization ever reported using a general pur-contribution factorer
Citations
| 2079 | A method for obtaining digital signatures and public-key cryptosystems – Rivest, Shamir, et al. - 1978 |
| 30 | The Future of Integer Factorization – Odlyzko - 1995 |
| 6 | The development of the number field sieve. Volume 1554 – Lenstra, Jr - 1993 |
