Cryptology ePrint Archive: Report 2012/691

Root Optimization of Polynomials in the Number Field Sieve

Shi Bai and 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.

Category / Keywords: foundations / factoring, number field sieve, polynomial selection

Date: received 10 Dec 2012

Contact author: shih bai at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20121210:120001 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]