Size Optimization of Sextic Polynomials in the Number Field Sieve

Shi Bai (1) , Paul Zimmermann (2)

1 ANU - Australian National University
2 CARAMEL - Cryptology, Arithmetic: Hardware and Software

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 methods to optimize the size properties of sextic polynomials.

Domaines: Algorithme et structure de données [cs.DS]

Shi Bai, Paul Zimmermann. Size Optimization of Sextic Polynomials in the Number Field Sieve. 2012. ⟨hal-00760331⟩