A kilobit hidden SNFS discrete logarithm computation

J Fried, P Gaudry, N Heninger, E Thomé - … International Conference on the …, 2017 - Springer
We perform a special number field sieve discrete logarithm computation in a 1024-bit prime
field. To our knowledge, this is the first kilobit-sized discrete logarithm computation ever
reported for prime fields. This computation took a little over two months of calendar time on
an academic cluster using the open-source CADO-NFS software. Our chosen prime p looks
random, and p-1 has a 160-bit prime factor, in line with recommended parameters for the
Digital Signature Algorithm. However, our p has been trapdoored in such a way that the …

[CITATION][C] A kilobit hidden SNFS discrete logarithm computation, EUROCRYPT 2017, Part I (Jean-Sébastien Coron and Jesper Buus Nielsen, eds.), LNCS, vol …

J Fried, P Gaudry, N Heninger, E Thomé - 2017 - Springer, Heidelberg
Showing the best results for this search. See all results