Skip to Main content Skip to Navigation
Conference papers

A kilobit hidden SNFS discrete logarithm computation

Joshua Fried 1 Pierrick Gaudry 2 Nadia Heninger 1 Emmanuel Thomé 2
1 CIS - Department of Computer and Information Science [Pennsylvania]
2 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms
LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry, Inria Nancy - Grand Est
Keywords : number field sieve finite field Discrete logarithm
Document type :
Conference papers
Complete list of metadata

Cited literature [43 references]  Display  Hide  Download
https://hal.inria.fr/hal-01376934
Contributor : Emmanuel Thomé <>
Submitted on : Tuesday, July 18, 2017 - 8:41:07 AM
Last modification on : Tuesday, January 5, 2021 - 7:46:36 PM
Long-term archiving on: : Saturday, January 27, 2018 - 3:01:02 AM

Files

Vignette du document
paper.pdf
Files produced by the author(s)

Identifiers

Collections

CNRS | UNIV-LORRAINE | LORIA-ALGO | LORIA | INRIA | GRID5000 | INSMI | SILECS

Citation

Joshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé. A kilobit hidden SNFS discrete logarithm computation. Advances in Cryptology – EUROCRYPT 2017, Apr 2017, Paris, France. pp.202-231, ⟨10.1007/978-3-319-56620-7_8⟩. ⟨hal-01376934v2⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

700

Files downloads

634

 

Contact                    Legal Notice                    Personal Data