论文信息 - On polynomial selection for the general number field sieve

On polynomial selection for the general number field sieve

The general number field sieve (GNFS) is the asymptotically fastest algorithm for factoring large integers. Its runtime depends on a good choice of a polynomial pair. In this article we present an improvement of the polynomial selection method of Montgomery and Murphy which has been used in recent GNFS records.

Thorsten Kleinjung | T. Kleinjung

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

[2] Jeff Gilchrist,et al. Factorization of a 512-Bit RSA Modulus , 2000, EUROCRYPT.

[3] Brian Murphy,et al. On Quadratic Polynomials for the Number Field Sieve , 1998, CATS.

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

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

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

[7] Hendrik W. Lenstra,et al. The number field sieve: An annotated bibliography , 1993 .