Root optimization of polynomials in the number field sieve - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Mathematics of Computation Year : 2015

Root optimization of polynomials in the number field sieve

Shi Bai
  • Function : Author
  • PersonId : 950597

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

Dates and versions

hal-00919367 , version 1 (16-12-2013)

Identifiers

Cite

Shi Bai, Richard Brent, Emmanuel Thomé. Root optimization of polynomials in the number field sieve. Mathematics of Computation, 2015, 84 (295), pp.2447-2457. ⟨10.1090/S0025-5718-2015-02926-3⟩. ⟨hal-00919367⟩
636 View
320 Download

Altmetric

Share

Gmail Facebook X LinkedIn More