On polynomial selection for the general number field sieve

Open Access

28 June 2006

journal article
Published by American Mathematical Society (AMS) in Mathematics of Computation

Vol. 75 (256) , 2037-2047
https://doi.org/10.1090/s0025-5718-06-01870-9

Abstract

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.

Keywords

INTEGER FACTORIZATION
GNFS
POLYNOMIAL SELECTION

This publication has 2 references indexed in Scilit:

Modelling the yield of number field sieve polynomials
Published by Springer Nature ,1998
The number field sieve: An annotated bibliography
Lecture Notes in Mathematics, 1993