Square root algorithms for the number field sieve

Emmanuel Thomé 1
1 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : We review several methods for the square root step of the Number Field Sieve, and present an original one, based on the Chinese Remainder Theorem.
Type de document :
Communication dans un congrès
Ferruh Özbudak and Francisco Rodríguez-Henríquez. 4th International Workshop on Arithmetic in Finite Fields - WAIFI 2012, Jul 2012, Bochum, Germany. Springer, 7369, pp.208-224, 2012, Lecture Notes in Computer Science; Arithmetic of Finite Fields 4th International Workshop, WAIFI 2012, Bochum, Germany, July 16-19, 2012. Proceedings. <10.1007/978-3-642-31662-3_15>
Liste complète des métadonnées


https://hal.inria.fr/hal-00756838
Contributeur : Emmanuel Thomé <>
Soumis le : vendredi 23 novembre 2012 - 18:53:47
Dernière modification le : mardi 13 décembre 2016 - 15:41:57
Document(s) archivé(s) le : dimanche 24 février 2013 - 03:55:40

Fichiers

nfs-sqrt.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Emmanuel Thomé. Square root algorithms for the number field sieve. Ferruh Özbudak and Francisco Rodríguez-Henríquez. 4th International Workshop on Arithmetic in Finite Fields - WAIFI 2012, Jul 2012, Bochum, Germany. Springer, 7369, pp.208-224, 2012, Lecture Notes in Computer Science; Arithmetic of Finite Fields 4th International Workshop, WAIFI 2012, Bochum, Germany, July 16-19, 2012. Proceedings. <10.1007/978-3-642-31662-3_15>. <hal-00756838>

Partager

Métriques

Consultations de
la notice

203

Téléchargements du document

214