Welcome to the resource topic for 2012/691
Title:
Root Optimization of Polynomials in the Number Field Sieve
Authors: Shi Bai, Richard P. Brent, 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.
ePrint: https://eprint.iacr.org/2012/691
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .