Pierrick Gaudry

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 37

Top Venues

IACR Cryptol. ePrint Arch.

CoRR

EUROCRYPT (1)

CCS

École Polytechnique, Palaiseau, France (PHD)

Education History

École Polytechnique, Palaiseau, France

PHD

Publications

Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot
Lattice Enumeration and Automorphisms for Tower NFS: A 521-Bit Discrete Logarithm Computation. J. Cryptol. 37 (1) (2024)
Cécile Pierrot, Camille Desenclos, Pierrick Gaudry, Paul Zimmermann
Deciphering Charles Quint (A diplomatic letter from 1547). HistoCrypt (2023)
Véronique Cortier, Alexandre Debant, Pierrick Gaudry, Stéphane Glondu
Belenios with Cast as Intended. FC Workshops (2023)
Mikael Bougon, Hervé Chabanne, Véronique Cortier, Alexandre Debant, Emmanuelle Dottax, Jannik Dreier, Pierrick Gaudry, Mathieu Turuani
Themis: An On-Site Voting System with Systematic Cast-as-intended Verification and Partial Accountability. CCS (2022)
Véronique Cortier, Pierrick Gaudry, Quentin Yang
A Toolbox for Verifiable Tally-Hiding E-Voting Systems. ESORICS (2) (2022)
Véronique Cortier, Pierrick Gaudry, Quentin Yang
Is the JCJ voting system really coercion-resistant? IACR Cryptol. ePrint Arch. 2022 (2022)
Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann
The State of the Art in Integer Factoring and Breaking Public-Key Cryptography. IEEE Secur. Priv. 20 (2) (2022)
Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot
Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation. IACR Cryptol. ePrint Arch. 2021 (2021)
Véronique Cortier, Pierrick Gaudry, Quentin Yang
A toolbox for verifiable tally-hiding e-voting systems. IACR Cryptol. ePrint Arch. 2021 (2021)
Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot
Lattice Enumeration for Tower NFS: A 521-Bit Discrete Logarithm Computation. ASIACRYPT (1) (2021)
Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment. IACR Cryptol. ePrint Arch. 2020 (2020)
Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot
Asymptotic Complexities of Discrete Logarithm Algorithms in Pairing-Relevant Finite Fields. CRYPTO (2) (2020)
Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann
Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment. CRYPTO (2) (2020)
Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot
Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields. IACR Cryptol. ePrint Arch. 2020 (2020)
Pierrick Gaudry, Alexander Golovnev
Breaking the Encryption Scheme of the Moscow Internet Voting System. Financial Cryptography (2020)
Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment. CoRR (2020)
David Adrian, Karthikeyan Bhargavan, Zakir Durumeric, Pierrick Gaudry, Matthew Green, J. Alex Halderman, Nadia Heninger, Drew Springall, Emmanuel Thomé, Luke Valenta, Benjamin VanderSloot, Eric Wustrow, Santiago Zanella Béguelin, Paul Zimmermann
Imperfect forward secrecy: how Diffie-Hellman fails in practice. Commun. ACM 62 (1) (2019)
Véronique Cortier, Pierrick Gaudry, Stéphane Glondu
Belenios: A Simple Private and Verifiable Electronic Voting System. Foundations of Security, Protocols, and Equational Reasoning (2019)
Pierrick Gaudry
Breaking the encryption scheme of the Moscow internet voting system. CoRR (2019)
Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer
Improved Complexity Bounds for Counting Points on Hyperelliptic Curves. Found. Comput. Math. 19 (3) (2019)
David Bernhard, Véronique Cortier, Pierrick Gaudry, Mathieu Turuani, Bogdan Warinschi
Verifiability Analysis of CHVote. IACR Cryptol. ePrint Arch. 2018 (2018)
Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer
Counting points on genus-3 hyperelliptic curves with explicit real multiplication. CoRR (2018)
Joshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé
A Kilobit Hidden SNFS Discrete Logarithm Computation. EUROCRYPT (1) (2017)
Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer
Improved Complexity Bounds for Counting Points on Hyperelliptic Curves. CoRR (2017)
Masahiro Ishii, Jérémie Detrey, Pierrick Gaudry, Atsuo Inomata, Kazutoshi Fujikawa
Fast Modular Arithmetic on the Kalray MPPA-256 Processor for an Energy-Efficient Implementation of ECM. IEEE Trans. Computers 66 (12) (2017)
Jean-Philippe Échard, Pierrick Gaudry
A harmonious encoding of instrument values by a nineteenth-century Parisian violin dealer. Cryptologia 41 (5) (2017)
Pierrick Gaudry, Laurent Grémy, Marion Videau
. IACR Cryptol. ePrint Arch. 2016 (2016)
Joshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé
A kilobit hidden SNFS discrete logarithm computation. IACR Cryptol. ePrint Arch. 2016 (2016)
Joshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé
A kilobit hidden SNFS discrete logarithm computation. CoRR (2016)
Steven D. Galbraith, Pierrick Gaudry
Recent progress on the elliptic curve discrete logarithm problem. Des. Codes Cryptogr. 78 (1) (2016)
Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain
Improving NFS for the discrete logarithm problem in non-prime finite fields. IACR Cryptol. ePrint Arch. 2016 (2016)
Masahiro Ishii, Jérémie Detrey, Pierrick Gaudry, Atsuo Inomata, Kazutoshi Fujikawa
Fast Modular Arithmetic on the Kalray MPPA-256 Processor for an Energy-Efficient Implementation of ECM. IACR Cryptol. ePrint Arch. 2016 (2016)
Razvan Barbulescu, Pierrick Gaudry, Thorsten Kleinjung
The Tower Number Field Sieve. IACR Cryptol. ePrint Arch. 2015 (2015)
Steven D. Galbraith, Pierrick Gaudry
Recent progress on the elliptic curve discrete logarithm problem. IACR Cryptol. ePrint Arch. 2015 (2015)
David Adrian, Karthikeyan Bhargavan, Zakir Durumeric, Pierrick Gaudry, Matthew Green, J. Alex Halderman, Nadia Heninger, Drew Springall, Emmanuel Thomé, Luke Valenta, Benjamin VanderSloot, Eric Wustrow, Santiago Zanella Béguelin, Paul Zimmermann
Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice. CCS (2015)
Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain
Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields. EUROCRYPT (1) (2015)
Razvan Barbulescu, Pierrick Gaudry, Thorsten Kleinjung
The Tower Number Field Sieve. ASIACRYPT (2) (2015)
Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann
Discrete Logarithm in GF(2809) with FFS. Public Key Cryptography (2014)
Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain
Improvements to the number field sieve for non-prime finite fields. CoRR (2014)
Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault
Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm. J. Cryptol. 27 (4) (2014)
Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé
A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic. EUROCRYPT (2014)
Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault
Sub-cubic change of ordering for Gröbner basis: a probabilistic approach. ISSAC (2014)
Jérémie Detrey, Pierrick Gaudry, Marion Videau
Relation collection for the Function Field Sieve. IACR Cryptol. ePrint Arch. 2013 (2013)
Jérémie Detrey, Pierrick Gaudry, Marion Videau
Relation Collection for the Function Field Sieve. IEEE Symposium on Computer Arithmetic (2013)
Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann
) with FFS. IACR Cryptol. ePrint Arch. 2013 (2013)
Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé
A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. IACR Cryptol. ePrint Arch. 2013 (2013)
Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault
Polynomial Systems Solving by Fast Linear Algebra CoRR (2013)
Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé
A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. CoRR (2013)
Pierrick Gaudry, Éric Schost
Genus 2 point counting over prime fields. J. Symb. Comput. 47 (4) (2012)
Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault
Fast change of ordering with exponent ω. ACM Commun. Comput. Algebra 46 (3/4) (2012)
Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault
Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm. IACR Cryptol. ePrint Arch. 2012 (2012)
Véronique Cortier, Jérémie Detrey, Pierrick Gaudry, Frédéric Sur, Emmanuel Thomé, Mathieu Turuani, Paul Zimmermann
Ballot stuffing in a postal voting system. REVOTE (2011)
Andreas Enge, Pierrick Gaudry, Emmanuel Thomé
(1/3) Discrete Logarithm Algorithm for Low Degree Curves. J. Cryptol. 24 (1) (2011)
Pierrick Gaudry, David R. Kohel, Benjamin A. Smith
Counting Points on Genus 2 Curves with Real Multiplication. IACR Cryptol. ePrint Arch. 2011 (2011)
Pierrick Gaudry, David R. Kohel, Benjamin A. Smith
Counting Points on Genus 2 Curves with Real Multiplication. ASIACRYPT (2011)
Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé, Joppe W. Bos, Pierrick Gaudry, Alexander Kruppa, Peter L. Montgomery, Dag Arne Osvik, Herman J. J. te Riele, Andrey Timofeev, Paul Zimmermann
Factorization of a 768-bit RSA modulus. IACR Cryptol. ePrint Arch. 2010 (2010)
Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé, Joppe W. Bos, Pierrick Gaudry, Alexander Kruppa, Peter L. Montgomery, Dag Arne Osvik, Herman J. J. te Riele, Andrey Timofeev, Paul Zimmermann
Factorization of a 768-Bit RSA Modulus. CRYPTO (2010)
Jérémie Detrey, Pierrick Gaudry, Karim Khalfallah
A Low-Area yet Performant FPGA Implementation of Shabal. IACR Cryptol. ePrint Arch. 2010 (2010)
Jérémie Detrey, Pierrick Gaudry, Karim Khalfallah
A Low-Area Yet Performant FPGA Implementation of Shabal. Selected Areas in Cryptography (2010)
Andreas Enge, Pierrick Gaudry, Emmanuel Thomé
An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves CoRR (2009)
Pierrick Gaudry
Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem. J. Symb. Comput. 44 (12) (2009)
Pierrick Gaudry, David Lubicz
The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines. Finite Fields Their Appl. 15 (2) (2009)
Richard P. Brent, Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann
Faster Multiplication in GF(2)[x]. ANTS (2008)
Pierrick Gaudry, David Lubicz
The arithmetic of characteristic 2 Kummer surfaces. IACR Cryptol. ePrint Arch. 2008 (2008)
Andreas Enge, Pierrick Gaudry
An L(1/3 + epsilon) Algorithm for the Discrete Logarithm Problem for Low Degree Curves CoRR (2007)
Pierrick Gaudry, Emmanuel Thomé, Nicolas Thériault, Claus Diem
A double large prime variation for small genus hyperelliptic index calculus. Math. Comput. 76 (257) (2007)
Alin Bostan, Pierrick Gaudry, Éric Schost
Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier-Manin Operator. SIAM J. Comput. 36 (6) (2007)
Andreas Enge, Pierrick Gaudry
) Algorithm for the Discrete Logarithm Problem for Low Degree Curves. EUROCRYPT (2007)
Pierrick Gaudry
Fast genus 2 arithmetic based on Theta functions. J. Math. Cryptol. 1 (3) (2007)
Pierrick Gaudry, Alexander Kruppa, Paul Zimmermann
A gmp-based implementation of schönhage-strassen's large integer multiplication algorithm. ISSAC (2007)
Pierrick Gaudry, T. Houtmann, David R. Kohel, Christophe Ritzenthaler, A. Weng
The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography. ASIACRYPT (2006)
Olivier Chevassut, Pierre-Alain Fouque, Pierrick Gaudry, David Pointcheval
The Twist-AUgmented Technique for Key Exchange. Public Key Cryptography (2006)
Pierrick Gaudry, Éric Schost, Nicolas M. Thiéry
Evaluation Properties of Symmetric Polynomials. Int. J. Algebra Comput. 16 (3) (2006)
Pierrick Gaudry, François Morain
Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm. ISSAC (2006)
Pierrick Gaudry, Éric Schost
Modular equations for hyperelliptic curves. Math. Comput. 74 (249) (2005)
Pierrick Gaudry
Fast genus 2 arithmetic based on Theta functions. IACR Cryptol. ePrint Arch. 2005 (2005)
Olivier Chevassut, Pierre-Alain Fouque, Pierrick Gaudry, David Pointcheval
Key Derivation and Randomness Extraction. IACR Cryptol. ePrint Arch. 2005 (2005)
Pierrick Gaudry, Emmanuel Thomé, Nicolas Thériault, Claus Diem
A double large prime variation for small genus hyperelliptic index calculus. IACR Cryptol. ePrint Arch. 2004 (2004)
Pierrick Gaudry, Éric Schost
A Low-Memory Parallel Version of Matsuo, Chao, and Tsujii?s Algorithm. ANTS (2004)
Pierrick Gaudry
Index calculus for abelian varieties and the elliptic curve discrete logarithm problem. IACR Cryptol. ePrint Arch. 2004 (2004)
Pierrick Gaudry, Éric Schost
Construction of Secure Random Curves of Genus 2 over Prime Fields. EUROCRYPT (2004)
Alin Bostan, Pierrick Gaudry, Éric Schost
Linear Recurrences with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves. International Conference on Finite Fields and Applications (2003)
Pierrick Gaudry, Nicolas Gürel
Counting Points in Medium Characteristic Using Kedlaya's Algorithm. Exp. Math. 12 (4) (2003)
Pierrick Gaudry
A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2. ASIACRYPT (2002)
Pierrick Gaudry, Florian Hess, Nigel P. Smart
Constructive and Destructive Facets of Weil Descent on Elliptic Curves. J. Cryptol. 15 (1) (2002)
Pierrick Gaudry, Éric Schost
On the Invariants of the Quotients of the Jacobian of a Curve of Genus 2. AAECC (2001)
Pierrick Gaudry, Nicolas Gürel
An Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves. ASIACRYPT (2001)
Mireille Fouquet, Pierrick Gaudry, Robert Harley
Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy. EUROCRYPT (2001)
Pierrick Gaudry
An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves. EUROCRYPT (2000)
Pierrick Gaudry, Robert Harley
Counting Points on Hyperelliptic Curves over Finite Fields. ANTS (2000)
Iwan M. Duursma, Pierrick Gaudry, François Morain
Speeding up the Discrete Log Computation on Curves with Automorphisms. ASIACRYPT (1999)

Pierrick Gaudry.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Pierrick Gaudry