Advances in Cryptology — ASIACRYPT '96

Volume 1163 of the series Lecture Notes in Computer Science pp 382-394


A World Wide Number Field Sieve factoring record: On to 512 bits

  • James CowieAffiliated withCooperating Systems Corporation
  • , Bruce DodsonAffiliated withDepartment of Mathematics, Lehigh University
  • , R. Marije Elkenbracht-HuizingAffiliated withCentrum voor Wiskunde en Informatica
  • , Arjen K. LenstraAffiliated withCitibank, N.A.
  • , Peter L. MontgomeryAffiliated with
  • , Jörg ZayerAffiliated with

* Final gross prices may vary according to local VAT.

Get Access


We present data concerning the factorization of the 130-digit number RSA130 which we factored on April 10, 1996, using the Number Field Sieve factoring method. This factorization beats the 129-digit record that was set on April 2, 1994, by the Quadratic Sieve method. The amount of computer time spent on our new record factorization is only a fraction of what was spent on the previous record. We also discuss a World Wide Web interface to our sieving program that we have developed to facilitate contributing to the sieving stage of future large scale factoring efforts. These developments have a serious impact on the security of RSA public key cryptosystems with small moduli. We present a conservative extrapolation to estimate the difficulty of factoring 512-bit numbers.