Pierrick Gaudry
More info
- Affiliation
- CNRS, LORIA (Nancy)
- Known for
- Logjam, CADO-NFS, RSA-240
French algorithmist who computes record-sized discrete logarithms and factorisations — and in doing so puts a price tag on how big keys need to be.
Gaudry is one of the developers of CADO-NFS, the open-source implementation of the number field sieve. In 2015 he co-authored the Logjam paper, which showed that TLS servers could still be downgraded to 512-bit export groups for Diffie-Hellman, and that a handful of 1024-bit primes were so widely shared that a nation state could plausibly have precomputed its way through them.
In December 2019 he and colleagues factored RSA-240 and solved a discrete logarithm of the same size; RSA-250 fell a couple of months later. On the side he co-develops the Belenios e-voting system, which is a sensible hobby for someone who knows exactly what can be broken.