On polynomial selection for the general number field sieve
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.
- Publication:
-
Mathematics of Computation
- Pub Date:
- December 2006
- DOI:
- 10.1090/S0025-5718-06-01870-9
- Bibcode:
- 2006MaCom..75.2037K
- Keywords:
-
- Integer factorization;
- GNFS;
- polynomial selection