Montgomery's method of polynomial selection for the number field sieve

Nicholas Coxon 1
1 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : The number field sieve is the most efficient known algorithm for factoring large integers that are free of small prime factors. For the polynomial selection stage of the algorithm, Montgomery proposed a method of generating polynomials which relies on the construction of small modular geometric progressions. Montgomery's method is analysed in this paper and the existence of suitable geometric progressions is considered.
Type de document :
Pré-publication, Document de travail
2014
Liste complète des métadonnées

https://hal.inria.fr/hal-01097069
Contributeur : Nicholas Coxon <>
Soumis le : jeudi 18 décembre 2014 - 17:11:01
Dernière modification le : jeudi 22 septembre 2016 - 14:31:23
Document(s) archivé(s) le : lundi 23 mars 2015 - 17:27:00

Fichiers

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

Identifiants

Collections

Citation

Nicholas Coxon. Montgomery's method of polynomial selection for the number field sieve. 2014. 〈hal-01097069〉

Partager

Métriques

Consultations de
la notice

392

Téléchargements du document

124