Root optimization of polynomials in the number field sieve

Shi Bai 1 Richard Brent 2 Emmanuel Thomé 3
1 Department of Mathematics
Department of Mathematics [Auckland]
3 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 algorithms for selecting polynomials with very good root properties.
Type de document :
Article dans une revue
Mathematics of Computation, American Mathematical Society, 2015, 84 (295), pp.2447-2457 <http://www.ams.org/journals/mcom/2015-84-295/S0025-5718-2015-02926-3/>. <10.1090/S0025-5718-2015-02926-3 >
Liste complète des métadonnées

https://hal.inria.fr/hal-00919367
Contributeur : Emmanuel Thomé <>
Soumis le : lundi 16 décembre 2013 - 16:12:54
Dernière modification le : jeudi 22 septembre 2016 - 14:31:25
Document(s) archivé(s) le : mardi 18 mars 2014 - 16:55:35

Fichiers

rs_mcomp.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Shi Bai, Richard Brent, Emmanuel Thomé. Root optimization of polynomials in the number field sieve. Mathematics of Computation, American Mathematical Society, 2015, 84 (295), pp.2447-2457 <http://www.ams.org/journals/mcom/2015-84-295/S0025-5718-2015-02926-3/>. <10.1090/S0025-5718-2015-02926-3 >. <hal-00919367>

Partager

Métriques

Consultations de
la notice

260

Téléchargements du document

162