25 citations · 83 across the 11 of their papers we have counts for
6 papers · 1 filter
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic +3
We report on two new records: the factorization of RSA-240, a 795-bit number, and a discrete logarithm computation over a 795-bit prime field. Previous records were the factorizati…
Breaking the encryption scheme of the Moscow Internet voting system
Pierrick Gaudry, Alexander Golovnev
In September 2019, voters for the election at the Parliament of the city of Moscow were allowed to use an Internet voting system. The source code of it had been made available for…
A kilobit hidden SNFS discrete logarithm computation
Joshua Fried, Pierrick Gaudry, Nadia Heninger +1
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 e…
A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
Razvan Barbulescu, Pierrick Gaudry, Antoine Joux +1
In the present work, we present a new discrete logarithm algorithm, in the same vein as in recent works by Joux, using an asymptotically more efficient descent approach. The main r…
An Discrete Logarithm Algorithm for Low Degree Curves
Andreas Enge, Pierrick Gaudry, Emmanuel Thomé
We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in and are low with respect to their genera. The f…
An Algorithm for the Discrete Logarithm Problem for Low Degree Curves
Andreas Enge, Pierrick Gaudry
The discrete logarithm problem in Jacobians of curves of high genus over finite fields $\FF_q$ is known to be computable with subexponential complexity . We…