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.
Liste complète des métadonnées

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-00756838
Contributor : Emmanuel Thomé <>
Submitted on : Friday, November 23, 2012 - 6:53:47 PM
Last modification on : Tuesday, December 18, 2018 - 4:18:25 PM
Document(s) archivé(s) le : Sunday, February 24, 2013 - 3:55:40 AM

Files

nfs-sqrt.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Emmanuel Thomé. Square root algorithms for the number field sieve. 4th International Workshop on Arithmetic in Finite Fields - WAIFI 2012, Jul 2012, Bochum, Germany. pp.208-224, ⟨10.1007/978-3-642-31662-3_15⟩. ⟨hal-00756838⟩

Share

Metrics

Record views

345

Files downloads

305