25 citations · 83 across the 11 of their papers we have counts for
13 papers
Computing Isomorphisms between Products of Supersingular Elliptic Curves
Pierrick Gaudry, Julien Soumier, Pierre-Jean Spaenlehauer
The Deligne-Ogus-Shioda theorem guarantees the existence of isomorphisms between products of supersingular elliptic curves over finite fields. In this paper, we present methods for…
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…
Counting points on genus-3 hyperelliptic curves with explicit real multiplication
Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer
We propose a Las Vegas probabilistic algorithm to compute the zeta function of a genus-3 hyperelliptic curve defined over a finite field , with explicit real multiplic…
Improved Complexity Bounds for Counting Points on Hyperelliptic Curves
Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer
We present a probabilistic Las Vegas algorithm for computing the local zeta function of a hyperelliptic curve of genus defined over . It is based on the approache…
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…