Pierrick Gaudry

According to our database, Pierrick Gaudry authored at least 74 papers between 1999 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Lattice Enumeration and Automorphisms for Tower NFS: A 521-Bit Discrete Logarithm Computation.

Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot

J. Cryptol., March, 2024

2023

Deciphering Charles Quint (A diplomatic letter from 1547).

Cécile Pierrot, Camille Desenclos, Pierrick Gaudry, Paul Zimmermann

Proceedings of the 6th International Conference on Historical Cryptology, 2023

Belenios with Cast as Intended.

Véronique Cortier, Alexandre Debant, Pierrick Gaudry, Stéphane Glondu

Proceedings of the Financial Cryptography and Data Security. FC 2023 International Workshops, 2023

2022

The State of the Art in Integer Factoring and Breaking Public-Key Cryptography.

Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann

IEEE Secur. Priv., 2022

Is the JCJ voting system really coercion-resistant?

Véronique Cortier, Pierrick Gaudry, Quentin Yang

IACR Cryptol. ePrint Arch., 2022

Themis: An On-Site Voting System with Systematic Cast-as-intended Verification and Partial Accountability.

Mikael Bougon, Hervé Chabanne, Véronique Cortier, Alexandre Debant, Emmanuelle Dottax, Jannik Dreier, Pierrick Gaudry, Mathieu Turuani

Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021

Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation.

Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot

IACR Cryptol. ePrint Arch., 2021

A toolbox for verifiable tally-hiding e-voting systems.

Véronique Cortier, Pierrick Gaudry, Quentin Yang

IACR Cryptol. ePrint Arch., 2021

2020

Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields.

Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot

IACR Cryptol. ePrint Arch., 2020

Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment.

Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann

IACR Cryptol. ePrint Arch., 2020

Breaking the Encryption Scheme of the Moscow Internet Voting System.

Pierrick Gaudry, Alexander Golovnev

Proceedings of the Financial Cryptography and Data Security, 2020

2019

Improved Complexity Bounds for Counting Points on Hyperelliptic Curves.

Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer

Found. Comput. Math., 2019

Breaking the encryption scheme of the Moscow internet voting system.

Pierrick Gaudry

CoRR, 2019

Imperfect forward secrecy: how Diffie-Hellman fails in practice.

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

Commun. ACM, 2019

Belenios: A Simple Private and Verifiable Electronic Voting System.

Véronique Cortier, Pierrick Gaudry, Stéphane Glondu

Proceedings of the Foundations of Security, Protocols, and Equational Reasoning, 2019

2018

Verifiability Analysis of CHVote.

David Bernhard, Véronique Cortier, Pierrick Gaudry, Mathieu Turuani, Bogdan Warinschi

IACR Cryptol. ePrint Arch., 2018

Counting points on genus-3 hyperelliptic curves with explicit real multiplication.

Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer

CoRR, 2018

2017

Fast Modular Arithmetic on the Kalray MPPA-256 Processor for an Energy-Efficient Implementation of ECM.

Masahiro Ishii, Jérémie Detrey, Pierrick Gaudry, Atsuo Inomata, Kazutoshi Fujikawa

IEEE Trans. Computers, 2017

A harmonious encoding of instrument values by a nineteenth-century Parisian violin dealer.

Jean-Philippe Échard, Pierrick Gaudry

Cryptologia, 2017

2016

Collecting relations for the number field sieve in.

Pierrick Gaudry, Laurent Grémy, Marion Videau

LMS J. Comput. Math., 2016

Collecting relations for the Number Field Sieve in GF(p⁶⁾.

Pierrick Gaudry, Laurent Grémy, Marion Videau

IACR Cryptol. ePrint Arch., 2016

A kilobit hidden SNFS discrete logarithm computation.

Joshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé

IACR Cryptol. ePrint Arch., 2016

Improving NFS for the discrete logarithm problem in non-prime finite fields.

Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain

IACR Cryptol. ePrint Arch., 2016

Recent progress on the elliptic curve discrete logarithm problem.

Steven D. Galbraith, Pierrick Gaudry

Des. Codes Cryptogr., 2016

2015

The Tower Number Field Sieve.

Razvan Barbulescu, Pierrick Gaudry, Thorsten Kleinjung

IACR Cryptol. ePrint Arch., 2015

2014

Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm.

Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault

J. Cryptol., 2014

Improvements to the number field sieve for non-prime finite fields.

Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain

CoRR, 2014

Discrete Logarithm in GF(2809) with FFS.

Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann

Proceedings of the Public-Key Cryptography - PKC 2014, 2014

Sub-cubic change of ordering for Gröbner basis: a probabilistic approach.

Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic.

Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé

Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013

Relation collection for the Function Field Sieve.

Jérémie Detrey, Pierrick Gaudry, Marion Videau

IACR Cryptol. ePrint Arch., 2013

A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic.

Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé

IACR Cryptol. ePrint Arch., 2013

Discrete logarithm in GF(2⁸⁰⁹) with FFS.

Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann

IACR Cryptol. ePrint Arch., 2013

Polynomial Systems Solving by Fast Linear Algebra

Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault

CoRR, 2013

2012

Genus 2 point counting over prime fields.

Pierrick Gaudry, Éric Schost

J. Symb. Comput., 2012

Fast change of ordering with exponent ω.

Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault

ACM Commun. Comput. Algebra, 2012

2011

Point Counting.

Pierrick Gaudry

Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

An <i>L</i>(1/3) Discrete Logarithm Algorithm for Low Degree Curves.

Andreas Enge, Pierrick Gaudry, Emmanuel Thomé

J. Cryptol., 2011

Counting Points on Genus 2 Curves with Real Multiplication.

Pierrick Gaudry, David R. Kohel, Benjamin A. Smith

IACR Cryptol. ePrint Arch., 2011

Ballot stuffing in a postal voting system.

Véronique Cortier, Jérémie Detrey, Pierrick Gaudry, Frédéric Sur, Emmanuel Thomé, Mathieu Turuani, Paul Zimmermann

Proceedings of the 2011 International Workshop on Requirements Engineering for Electronic Voting Systems, 2011

2010

Factorization of a 768-bit RSA modulus.

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

IACR Cryptol. ePrint Arch., 2010

A Low-Area yet Performant FPGA Implementation of Shabal.

Jérémie Detrey, Pierrick Gaudry, Karim Khalfallah

IACR Cryptol. ePrint Arch., 2010

2009

Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem.

Pierrick Gaudry

J. Symb. Comput., 2009

The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines.

Pierrick Gaudry, David Lubicz

Finite Fields Their Appl., 2009

An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves

Andreas Enge, Pierrick Gaudry, Emmanuel Thomé

CoRR, 2009

2008

The arithmetic of characteristic 2 Kummer surfaces.

Pierrick Gaudry, David Lubicz

IACR Cryptol. ePrint Arch., 2008

Faster Multiplication in GF(2)[x].

Richard P. Brent, Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann

Proceedings of the Algorithmic Number Theory, 8th International Symposium, 2008

Algorithmique des courbes algébriques pour la cryptologie.

Pierrick Gaudry

, 2008

2007

Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier-Manin Operator.

Alin Bostan, Pierrick Gaudry, Éric Schost

SIAM J. Comput., 2007

A double large prime variation for small genus hyperelliptic index calculus.

Pierrick Gaudry, Emmanuel Thomé, Nicolas Thériault, Claus Diem

Math. Comput., 2007

An L(1/3 + epsilon) Algorithm for the Discrete Logarithm Problem for Low Degree Curves

Andreas Enge, Pierrick Gaudry

CoRR, 2007

A gmp-based implementation of schönhage-strassen's large integer multiplication algorithm.

Pierrick Gaudry, Alexander Kruppa, Paul Zimmermann

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

An <i>L</i> (1/3 + <i>epsilon</i> ) Algorithm for the Discrete Logarithm Problem for Low Degree Curves.

Andreas Enge, Pierrick Gaudry

Proceedings of the Advances in Cryptology, 2007

2006

Evaluation Properties of Symmetric Polynomials.

Pierrick Gaudry, Éric Schost, Nicolas M. Thiéry

Int. J. Algebra Comput., 2006

The Twist-AUgmented Technique for Key Exchange.

Olivier Chevassut, Pierre-Alain Fouque, Pierrick Gaudry, David Pointcheval

Proceedings of the Public Key Cryptography, 2006

Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm.

Pierrick Gaudry, François Morain

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography.

Pierrick Gaudry, T. Houtmann, David R. Kohel, Christophe Ritzenthaler, A. Weng

Proceedings of the Advances in Cryptology, 2006

2005

Modular equations for hyperelliptic curves.

Pierrick Gaudry, Éric Schost

Math. Comput., 2005

Fast genus 2 arithmetic based on Theta functions.

Pierrick Gaudry

IACR Cryptol. ePrint Arch., 2005

Key Derivation and Randomness Extraction.

Olivier Chevassut, Pierre-Alain Fouque, Pierrick Gaudry, David Pointcheval

IACR Cryptol. ePrint Arch., 2005

2004

Index calculus for abelian varieties and the elliptic curve discrete logarithm problem.

Pierrick Gaudry

IACR Cryptol. ePrint Arch., 2004

Construction of Secure Random Curves of Genus 2 over Prime Fields.

Pierrick Gaudry, Éric Schost

Proceedings of the Advances in Cryptology, 2004

A Low-Memory Parallel Version of Matsuo, Chao, and Tsujii?s Algorithm.

Pierrick Gaudry, Éric Schost

Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

2003

Counting Points in Medium Characteristic Using Kedlaya's Algorithm.

Pierrick Gaudry, Nicolas Gürel

Exp. Math., 2003

Linear Recurrences with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves.

Alin Bostan, Pierrick Gaudry, Éric Schost

Proceedings of the Finite Fields and Applications, 2003

2002

Constructive and Destructive Facets of Weil Descent on Elliptic Curves.

Pierrick Gaudry, Florian Hess, Nigel P. Smart

J. Cryptol., 2002

A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2.

Pierrick Gaudry

Proceedings of the Advances in Cryptology, 2002

2001

Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy.

Mireille Fouquet, Pierrick Gaudry, Robert Harley

Proceedings of the Advances in Cryptology, 2001

An Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves.

Pierrick Gaudry, Nicolas Gürel

Proceedings of the Advances in Cryptology, 2001

On the Invariants of the Quotients of the Jacobian of a Curve of Genus 2.

Pierrick Gaudry, Éric Schost

Proceedings of the Applied Algebra, 2001

2000

Algorithmique des courbes hyperelliptiques et applications à la cryptologie.

Pierrick Gaudry

PhD thesis, 2000

An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves.

Pierrick Gaudry

Proceedings of the Advances in Cryptology, 2000

Counting Points on Hyperelliptic Curves over Finite Fields.

Pierrick Gaudry, Robert Harley

Proceedings of the Algorithmic Number Theory, 4th International Symposium, 2000

1999

Speeding up the Discrete Log Computation on Curves with Automorphisms.

Iwan M. Duursma, Pierrick Gaudry, François Morain

Proceedings of the Advances in Cryptology, 1999