Size Optimization of Sextic Polynomials in the Number Field Sieve - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2012

Size Optimization of Sextic Polynomials in the Number Field Sieve

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.
Fichier principal
Vignette du fichier
sopt.pdf (178.22 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00760331 , version 1 (03-12-2012)

Identifiers

  • HAL Id : hal-00760331 , version 1

Cite

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

Share

Gmail Mastodon Facebook X LinkedIn More