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 metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-00760331
Contributor : Paul Zimmermann <>
Submitted on : Monday, December 3, 2012 - 4:54:57 PM
Last modification on : Tuesday, December 18, 2018 - 4:18:25 PM
Long-term archiving on : Monday, March 4, 2013 - 3:51:14 AM

File

sopt.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00760331, version 1

Collections

Citation

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

Share

Metrics

Record views

445

Files downloads

143