Factorization of a 512-Bit RSA Modulus

This paper reports on the factorization of the 512-bit number RSA-155 by the Number Field Sieve factoring method (NFS) and discusses the implications for RSA.

[1]  John Brillhart,et al.  The factorization of $F_7$ , 1971 .

[2]  Arjen K. Lenstra,et al.  A World Wide Number Field Sieve Factoring Record: On to 512 Bits , 1996, ASIACRYPT.

[3]  Arjen K. Lenstra,et al.  Selecting Cryptographic Key Sizes , 2000, Journal of Cryptology.

[4]  D. Coppersmith.  Solving homogeneous linear equations over GF (2) via block Wiedemann algorithm , 1994 .

[5]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[6]  A. K. Lenstra,et al.  Implementation of a New Primality Test , 1985 .

[7]  Thomas Beth,et al.  Public-Key Cryptography: State of the Art and Future Directions , 1992, Lecture Notes in Computer Science.

[8]  Arjen K. Lenstra,et al.  Factorization of RSA-140 Using the Number Field Sieve , 1999, ASIACRYPT.

[9]  Stefania Cavallar,et al.  Strategies in Filtering in the Number Field Sieve , 2000, ANTS.

[10]  H. Lenstra,et al.  Factoring integers with the number field sieve , 1993 .

[11]  Robert D. Silverman.  The multiple polynomial quadratic sieve , 1987 .

[12]  James A. Davis,et al.  Status Report on Factoring (At the Sandia National Laboratories) , 1984, EUROCRYPT.

[13]  Arjen K. Lenstra,et al.  Factoring With Two Large Primes , 1990, EUROCRYPT.

[14]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[15]  Shirley Dex,et al.  JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

[16]  Carl Pomerance,et al.  The Quadratic Sieve Factoring Algorithm , 1985, EUROCRYPT.

[17]  Arjen K. Lenstra,et al.  Factoring by Electronic Mail , 1990, EUROCRYPT.

[18]  Leonard M. Adleman,et al.  Factoring numbers using singular integers , 1991, STOC '91.

[19]  Arjen K. Lenstra,et al.  NFS with Four Large Primes: An Explosive Experiment , 1995, CRYPTO.

[20]  J. Pollard.  The lattice sieve , 1993 .

[21]  Peter L. Montgomery,et al.  A Block Lanczos Algorithm for Finding Dependencies Over GF(2) , 1995, EUROCRYPT.

[22]  Adi Shamir.  Factoring Large Numbers with the Twinkle Device (Extended Abstract) , 1999, CHES.

[23]  Richard P. Brent,et al.  Some Parallel Algorithms for Integer Factorisation , 1999, Euro-Par.

[24]  Arjen K. Lenstra,et al.  Factoring with two large primes (extended abstract) , 1991 .

[25]  Tsutomu Matsumoto,et al.  Advances in Cryptology — ASIACRYPT'94 , 1994, Lecture Notes in Computer Science.

[26]  Gustavus J. Simmons,et al.  Status report on factoring (at the Sandia National Labs) , 1985 .

[27]  Dik Winter,et al.  Factoring with the quadratic sieve on large vector computers , 1989 .

[28]  A. K. Lenstra,et al.  The factorization of the ninth Fermat number , 1993 .

[29]  Brian Murphy,et al.  Modelling the Yield of Number Field Sieve Polynominals , 1998, ANTS.

[30]  Arjen K. Lenstra,et al.  The Magic Words are Squeamish Ossifrage , 1994, ASIACRYPT.

[31]  N. S. Barnett,et al.  Private communication , 1969 .

[32]  J. L. Selfridge,et al.  Factorizations of b[n]±1, b=2, 3, 5, 6, 7, 10, 11, 12 up to high powers , 1985 .

[33]  Arjen K. Lenstra,et al.  Lattice sieving and trial division , 1994, ANTS.

[34]  Phong Q. Nguyen.  A Montgomery-Like Square Root for the Number Field Sieve , 1998, ANTS.

[35]  J. Brillhart,et al.  A method of factoring and the factorization of , 1975 .

[36]  Arjen K. Lenstra,et al.  Factoring Integers Using SIMD Sieves , 1994, EUROCRYPT.

[37]  Arjen K. Lenstra,et al.  On the Factorization of RSA-120 , 1993, CRYPTO.

[38]  Arjen K. Lenstra,et al.  The number field sieve , 1990, STOC '90.

[39]  R. Marije Elkenbracht-Huizing,et al.  An Implementation of the Number Field Sieve , 1996, Exp. Math..

[40]  Peter L. Montgomery,et al.  Square roots of products of algebraic numbers , 1994 .

[41]  Carl Pomerance,et al.  The Development of the Number Field Sieve , 1994 .

[42]  B. Murphy.  Polynomial Selection for the Number Field Sieve Integer Factorisation Algorithm , 1999 .

[43]  J. Dixon.  Asymptotically fast factorization of integers , 1981 .