Size Optimization of Sextic Polynomials in the Number Field Sieve (original) (raw)
Pré-Publication, Document De Travail Année : 2012
Résumé
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.
Connectez-vous pour contacter le contributeur
https://inria.hal.science/hal-00760331
Soumis le : lundi 3 décembre 2012-16:54:57
Dernière modification le : mardi 4 novembre 2025-12:02:31
Archivage à long terme le : lundi 4 mars 2013-03:51:14
Dates et versions
hal-00760331 , version 1 (03-12-2012)
Licence
Identifiants
- HAL Id : hal-00760331 , version 1
Citer
Shi Bai, Paul Zimmermann. Size Optimization of Sextic Polynomials in the Number Field Sieve. 2012. ⟨hal-00760331⟩
393 Consultations
311 Téléchargements