Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2006.06197
Cited By
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
11 June 2020
Fabrice Boudot
P. Gaudry
Aurore Guillevic
N. Heninger
Emmanuel Thomé
P. Zimmermann
CoGe
LRM
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment"
1 / 1 papers shown
Title
A kilobit hidden SNFS discrete logarithm computation
Joshua Fried
P. Gaudry
N. Heninger
Emmanuel Thomé
30
54
0
10 Oct 2016
1
