### 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.

Available format(s)
Category
Foundations
Publication info
Published elsewhere. Unknown where it was published
Keywords
factoringnumber field sievepolynomial selection
Contact author(s)
shih bai @ gmail com
History
Short URL
https://ia.cr/2012/691

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},
note = {\url{https://eprint.iacr.org/2012/691}},
url = {https://eprint.iacr.org/2012/691}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.