Square root algorithms for the number field sieve - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Square root algorithms for the number field sieve

Emmanuel Thomé
Cryptology, Arithmetic: Hardware and Software

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.

Domains

Cryptography and Security [cs.CR] Number Theory [math.NT]
Fichier principal
Vignette du fichier
nfs-sqrt.pdf (245.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Emmanuel Thomé  : Connect in order to contact the contributor

https://inria.hal.science/hal-00756838

Submitted on : Friday, November 23, 2012-6:53:47 PM

Last modification on : Wednesday, April 24, 2024-3:01:07 PM

Long-term archiving on: Sunday, February 24, 2013-3:55:40 AM

Download

Dates and versions

hal-00756838 , version 1 (23-11-2012)

Identifiers

Cite

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

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS INRIA UNIV-LORRAINE INRIA2 LORIA LORIA-ALGO
323 View
283 Download

Altmetric

Share

Gmail Facebook X LinkedIn More