Root Optimization of Polynomials in the Number Field Sieve

Shi Bai; Richard P.  Brent; Emmanuel Thomé

Paper 2012/691

Root Optimization of Polynomials in the Number Field Sieve

Shi Bai, Richard P. Brent, and Emmanuel Thomé

Abstract

The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The quality of the chosen polynomials in polynomial selection can be modelled in terms of size and root properties. In this paper, we describe some algorithms for selecting polynomials with very good root properties.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Published elsewhere. Unknown where it was published
Keywords: factoring number field sieve polynomial selection
Contact author(s): shih bai @ gmail com
History: 2012-12-10: received
Short URL: https://ia.cr/2012/691
License: CC BY

BibTeX

@misc{cryptoeprint:2012/691,
      author = {Shi Bai and Richard P.  Brent and Emmanuel Thomé},
      title = {Root Optimization of Polynomials in the Number Field Sieve},
      howpublished = {Cryptology {ePrint} Archive, Paper 2012/691},
      year = {2012},
      url = {https://eprint.iacr.org/2012/691}
}