Skip to Main content Skip to Navigation
New interface
Preprints, Working Papers, ...

Size Optimization of Sextic Polynomials in the Number Field Sieve

Shi Bai 1 Paul Zimmermann 2 
2 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
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 methods to optimize the size properties of sextic polynomials.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Paul Zimmermann Connect in order to contact the contributor
Submitted on : Monday, December 3, 2012 - 4:54:57 PM
Last modification on : Friday, November 18, 2022 - 10:14:05 AM
Long-term archiving on: : Monday, March 4, 2013 - 3:51:14 AM


Files produced by the author(s)


  • HAL Id : hal-00760331, version 1



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



Record views


Files downloads