Pierrick Gaudry

106 papers A* 8A 6B 4C 1Journal 61Unranked 22

Year	Rank	Type	Title / Venue / Authors
2026	—	`ed.`	Electronic Voting - 10th International Joint Conference, E-Vote-ID 2025, Nancy, France, October 1-3, 2025, Proceedings E-VOTE-ID David Duenas-Cid, Peter B. Roenne, Melanie Volkamer, Michelle L. Blom, Pierrick Gaudry, Isabelle Borucki, Leontine Loeber, Alexandre Debant
2025	J	`jnl`	A Practical and Fully Distributed E-Voting Protocol for the Swiss Context. IACR Cryptol. ePrint Arch. Véronique Cortier, Alexandre Debant, Olivier Esseiva, Pierrick Gaudry, Audhild Høgåsen, Chiara Spadafora
2025	—	`conf`	Breaking Verifiability and Vote Privacy in CHVote. ESORICS (4) Véronique Cortier, Alexandre Debant, Pierrick Gaudry
2025	J	`jnl`	Breaking verifiability and vote privacy in CHVote. IACR Cryptol. ePrint Arch. Véronique Cortier, Alexandre Debant, Pierrick Gaudry
2025	J	`jnl`	Computing Isomorphisms between Products of Supersingular Elliptic Curves. CoRR Pierrick Gaudry, Julien Soumier, Pierre-Jean Spaenlehauer
2025	J	`jnl`	Isogeny-based Cryptography using Isomorphisms of Superspecial Abelian Surfaces. IACR Cryptol. ePrint Arch. Pierrick Gaudry, Julien Soumier, Pierre-Jean Spaenlehauer
2025	J	`jnl`	Vote&Check: Secure Postal Voting with Reduced Trust Assumptions. Proc. Priv. Enhancing Technol. Véronique Cortier, Alexandre Debant, Pierrick Gaudry, Léo Louistisserand
2024	—	`conf`	Belenios with Cast-as-Intended: Towards a Usable Interface. E-Vote-ID Véronique Cortier, Pierrick Gaudry, Anselme Goetschmann, Sophie Lemonnier
2024	A	`conf`	Is the JCJ voting system really coercion-resistant? CSF Véronique Cortier, Pierrick Gaudry, Quentin Yang
2024	J	`jnl`	Lattice Enumeration and Automorphisms for Tower NFS: A 521-Bit Discrete Logarithm Computation. J. Cryptol. Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot
2024	J	`jnl`	Vote&Check: Secure Postal Voting with Reduced Trust Assumptions. IACR Cryptol. ePrint Arch. Véronique Cortier, Alexandre Debant, Pierrick Gaudry, Léo Louistisserand
2023	—	`conf`	Belenios with Cast as Intended. FC Workshops Véronique Cortier, Alexandre Debant, Pierrick Gaudry, Stéphane Glondu
2023	—	`conf`	Deciphering Charles Quint (A diplomatic letter from 1547). HistoCrypt Cécile Pierrot, Camille Desenclos, Pierrick Gaudry, Paul Zimmermann
2023	—	`conf`	French 2022 legislatives elections. E-Vote-ID (GI) Véronique Cortier, Pierrick Gaudry, Stéphane Glondu, Sylvain Ruhault
2022	—	`conf`	A Toolbox for Verifiable Tally-Hiding E-Voting Systems. ESORICS (2) Véronique Cortier, Pierrick Gaudry, Quentin Yang
2022	J	`jnl`	Is the JCJ voting system really coercion-resistant? IACR Cryptol. ePrint Arch. Véronique Cortier, Pierrick Gaudry, Quentin Yang
2022	J	`jnl`	The State of the Art in Integer Factoring and Breaking Public-Key Cryptography. IEEE Secur. Priv. Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann
2022	A*	`conf`	Themis: An On-Site Voting System with Systematic Cast-as-intended Verification and Partial Accountability. CCS Mikael Bougon, Hervé Chabanne, Véronique Cortier, Alexandre Debant, Emmanuelle Dottax, Jannik Dreier, Pierrick Gaudry, Mathieu Turuani
2021	J	`jnl`	A toolbox for verifiable tally-hiding e-voting systems. IACR Cryptol. ePrint Arch. Véronique Cortier, Pierrick Gaudry, Quentin Yang
2021	—	`conf`	Lattice Enumeration for Tower NFS: A 521-Bit Discrete Logarithm Computation. ASIACRYPT (1) Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot
2021	J	`jnl`	Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation. IACR Cryptol. ePrint Arch. Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot
2020	—	`conf`	Asymptotic Complexities of Discrete Logarithm Algorithms in Pairing-Relevant Finite Fields. CRYPTO (2) Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot
2020	J	`jnl`	Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields. IACR Cryptol. ePrint Arch. Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot
2020	—	`conf`	Breaking the Encryption Scheme of the Moscow Internet Voting System. Financial Cryptography Pierrick Gaudry, Alexander Golovnev
2020	—	`conf`	Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment. CRYPTO (2) Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann
2020	J	`jnl`	Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment. CoRR Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann
2020	J	`jnl`	Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment. IACR Cryptol. ePrint Arch. Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann
2019	—	`conf`	Belenios: A Simple Private and Verifiable Electronic Voting System. Foundations of Security, Protocols, and Equational Reasoning Véronique Cortier, Pierrick Gaudry, Stéphane Glondu
2019	J	`jnl`	Breaking the encryption scheme of the Moscow internet voting system. CoRR Pierrick Gaudry
2019	J	`jnl`	Imperfect forward secrecy: how Diffie-Hellman fails in practice. Commun. ACM 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
2019	J	`jnl`	Improved Complexity Bounds for Counting Points on Hyperelliptic Curves. Found. Comput. Math. Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer
2018	J	`jnl`	Counting points on genus-3 hyperelliptic curves with explicit real multiplication. CoRR Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer
2018	J	`jnl`	Verifiability Analysis of CHVote. IACR Cryptol. ePrint Arch. David Bernhard, Véronique Cortier, Pierrick Gaudry, Mathieu Turuani, Bogdan Warinschi
2017	—	`conf`	A Kilobit Hidden SNFS Discrete Logarithm Computation. EUROCRYPT (1) Joshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé
2017	J	`jnl`	A harmonious encoding of instrument values by a nineteenth-century Parisian violin dealer. Cryptologia Jean-Philippe Échard, Pierrick Gaudry
2017	J	`jnl`	Fast Modular Arithmetic on the Kalray MPPA-256 Processor for an Energy-Efficient Implementation of ECM. IEEE Trans. Computers Masahiro Ishii, Jérémie Detrey, Pierrick Gaudry, Atsuo Inomata, Kazutoshi Fujikawa
2017	J	`jnl`	Improved Complexity Bounds for Counting Points on Hyperelliptic Curves. CoRR Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer
2016	J	`jnl`	A kilobit hidden SNFS discrete logarithm computation. CoRR Joshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé
2016	J	`jnl`	A kilobit hidden SNFS discrete logarithm computation. IACR Cryptol. ePrint Arch. Joshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé
2016	J	`jnl`	Collecting relations for the Number Field Sieve in GF(p IACR Cryptol. ePrint Arch. Pierrick Gaudry, Laurent Grémy, Marion Videau
2016	J	`jnl`	Collecting relations for the number field sieve in. LMS J. Comput. Math. Pierrick Gaudry, Laurent Grémy, Marion Videau
2016	J	`jnl`	Fast Modular Arithmetic on the Kalray MPPA-256 Processor for an Energy-Efficient Implementation of ECM. IACR Cryptol. ePrint Arch. Masahiro Ishii, Jérémie Detrey, Pierrick Gaudry, Atsuo Inomata, Kazutoshi Fujikawa
2016	J	`jnl`	Improving NFS for the discrete logarithm problem in non-prime finite fields. IACR Cryptol. ePrint Arch. Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain
2016	J	`jnl`	Recent progress on the elliptic curve discrete logarithm problem. Des. Codes Cryptogr. Steven D. Galbraith, Pierrick Gaudry
2015	A*	`conf`	Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice. CCS 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
2015	—	`conf`	Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields. EUROCRYPT (1) Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain
2015	J	`jnl`	Recent progress on the elliptic curve discrete logarithm problem. IACR Cryptol. ePrint Arch. Steven D. Galbraith, Pierrick Gaudry
2015	—	`conf`	The Tower Number Field Sieve. ASIACRYPT (2) Razvan Barbulescu, Pierrick Gaudry, Thorsten Kleinjung
2015	J	`jnl`	The Tower Number Field Sieve. IACR Cryptol. ePrint Arch. Razvan Barbulescu, Pierrick Gaudry, Thorsten Kleinjung
2014	A*	`conf`	A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic. EUROCRYPT Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé
2014	—	`conf`	Discrete Logarithm in GF(2809) with FFS. Public Key Cryptography Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann
2014	J	`jnl`	Improvements to the number field sieve for non-prime finite fields. CoRR Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain
2014	B	`conf`	Sub-cubic change of ordering for Gröbner basis: a probabilistic approach. ISSAC Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault
2014	J	`jnl`	Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm. J. Cryptol. Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault
2013	J	`jnl`	A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. CoRR Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé
2013	J	`jnl`	A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. IACR Cryptol. ePrint Arch. Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé
2013	J	`jnl`	Discrete logarithm in GF(2 IACR Cryptol. ePrint Arch. Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann
2013	J	`jnl`	Polynomial Systems Solving by Fast Linear Algebra CoRR Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault
2013	C	`conf`	Relation Collection for the Function Field Sieve. IEEE Symposium on Computer Arithmetic Jérémie Detrey, Pierrick Gaudry, Marion Videau
2013	J	`jnl`	Relation collection for the Function Field Sieve. IACR Cryptol. ePrint Arch. Jérémie Detrey, Pierrick Gaudry, Marion Videau
2012	J	`jnl`	Fast change of ordering with exponent ω. ACM Commun. Comput. Algebra Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault
2012	J	`jnl`	Genus 2 point counting over prime fields. J. Symb. Comput. Pierrick Gaudry, Éric Schost
2012	J	`jnl`	Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm. IACR Cryptol. ePrint Arch. Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault
2011	J	`jnl`	An J. Cryptol. Andreas Enge, Pierrick Gaudry, Emmanuel Thomé
2011	—	`conf`	Ballot stuffing in a postal voting system. REVOTE Véronique Cortier, Jérémie Detrey, Pierrick Gaudry, Frédéric Sur, Emmanuel Thomé, Mathieu Turuani, Paul Zimmermann
2011	A	`conf`	Counting Points on Genus 2 Curves with Real Multiplication. ASIACRYPT Pierrick Gaudry, David R. Kohel, Benjamin A. Smith
2011	J	`jnl`	Counting Points on Genus 2 Curves with Real Multiplication. IACR Cryptol. ePrint Arch. Pierrick Gaudry, David R. Kohel, Benjamin A. Smith
2011	—	`ch.`	Point Counting. Encyclopedia of Cryptography and Security (2nd Ed.) Pierrick Gaudry
2010	B	`conf`	A Low-Area Yet Performant FPGA Implementation of Shabal. Selected Areas in Cryptography Jérémie Detrey, Pierrick Gaudry, Karim Khalfallah
2010	J	`jnl`	A Low-Area yet Performant FPGA Implementation of Shabal. IACR Cryptol. ePrint Arch. Jérémie Detrey, Pierrick Gaudry, Karim Khalfallah
2010	A*	`conf`	Factorization of a 768-Bit RSA Modulus. CRYPTO 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
2010	J	`jnl`	Factorization of a 768-bit RSA modulus. IACR Cryptol. ePrint Arch. 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
2009	J	`jnl`	An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves CoRR Andreas Enge, Pierrick Gaudry, Emmanuel Thomé
2009	J	`jnl`	Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem. J. Symb. Comput. Pierrick Gaudry
2009	J	`jnl`	The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines. Finite Fields Their Appl. Pierrick Gaudry, David Lubicz
2008	—	`book`	Algorithmique des courbes algébriques pour la cryptologie. Pierrick Gaudry
2008	—	`conf`	Faster Multiplication in GF(2)[x]. ANTS Richard P. Brent, Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann
2008	J	`jnl`	The arithmetic of characteristic 2 Kummer surfaces. IACR Cryptol. ePrint Arch. Pierrick Gaudry, David Lubicz
2007	J	`jnl`	A double large prime variation for small genus hyperelliptic index calculus. Math. Comput. Pierrick Gaudry, Emmanuel Thomé, Nicolas Thériault, Claus Diem
2007	B	`conf`	A gmp-based implementation of schönhage-strassen's large integer multiplication algorithm. ISSAC Pierrick Gaudry, Alexander Kruppa, Paul Zimmermann
2007	A*	`conf`	An EUROCRYPT Andreas Enge, Pierrick Gaudry
2007	J	`jnl`	An L(1/3 + epsilon) Algorithm for the Discrete Logarithm Problem for Low Degree Curves CoRR Andreas Enge, Pierrick Gaudry
2007	J	`jnl`	Fast genus 2 arithmetic based on Theta functions. J. Math. Cryptol. Pierrick Gaudry
2007	J	`jnl`	Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier-Manin Operator. SIAM J. Comput. Alin Bostan, Pierrick Gaudry, Éric Schost
2006	J	`jnl`	Evaluation Properties of Symmetric Polynomials. Int. J. Algebra Comput. Pierrick Gaudry, Éric Schost, Nicolas M. Thiéry
2006	B	`conf`	Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm. ISSAC Pierrick Gaudry, François Morain
2006	A	`conf`	The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography. ASIACRYPT Pierrick Gaudry, T. Houtmann, David R. Kohel, Christophe Ritzenthaler, A. Weng
2006	—	`conf`	The Twist-AUgmented Technique for Key Exchange. Public Key Cryptography Olivier Chevassut, Pierre-Alain Fouque, Pierrick Gaudry, David Pointcheval
2005	J	`jnl`	Fast genus 2 arithmetic based on Theta functions. IACR Cryptol. ePrint Arch. Pierrick Gaudry
2005	J	`jnl`	Key Derivation and Randomness Extraction. IACR Cryptol. ePrint Arch. Olivier Chevassut, Pierre-Alain Fouque, Pierrick Gaudry, David Pointcheval
2005	J	`jnl`	Modular equations for hyperelliptic curves. Math. Comput. Pierrick Gaudry, Éric Schost
2004	—	`conf`	A Low-Memory Parallel Version of Matsuo, Chao, and Tsujii?s Algorithm. ANTS Pierrick Gaudry, Éric Schost
2004	J	`jnl`	A double large prime variation for small genus hyperelliptic index calculus. IACR Cryptol. ePrint Arch. Pierrick Gaudry, Emmanuel Thomé, Nicolas Thériault, Claus Diem
2004	A*	`conf`	Construction of Secure Random Curves of Genus 2 over Prime Fields. EUROCRYPT Pierrick Gaudry, Éric Schost
2004	J	`jnl`	Index calculus for abelian varieties and the elliptic curve discrete logarithm problem. IACR Cryptol. ePrint Arch. Pierrick Gaudry
2003	J	`jnl`	Counting Points in Medium Characteristic Using Kedlaya's Algorithm. Exp. Math. Pierrick Gaudry, Nicolas Gürel
2003	—	`conf`	Linear Recurrences with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves. International Conference on Finite Fields and Applications Alin Bostan, Pierrick Gaudry, Éric Schost
2002	A	`conf`	A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2. ASIACRYPT Pierrick Gaudry
2002	J	`jnl`	Constructive and Destructive Facets of Weil Descent on Elliptic Curves. J. Cryptol. Pierrick Gaudry, Florian Hess, Nigel P. Smart
2001	A	`conf`	An Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves. ASIACRYPT Pierrick Gaudry, Nicolas Gürel
2001	A*	`conf`	Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy. EUROCRYPT Mireille Fouquet, Pierrick Gaudry, Robert Harley
2001	—	`conf`	On the Invariants of the Quotients of the Jacobian of a Curve of Genus 2. AAECC Pierrick Gaudry, Éric Schost
2000	—	`—`	Algorithmique des courbes hyperelliptiques et applications à la cryptologie. Pierrick Gaudry
2000	A*	`conf`	An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves. EUROCRYPT Pierrick Gaudry
2000	—	`conf`	Counting Points on Hyperelliptic Curves over Finite Fields. ANTS Pierrick Gaudry, Robert Harley
1999	A	`conf`	Speeding up the Discrete Log Computation on Curves with Automorphisms. ASIACRYPT Iwan M. Duursma, Pierrick Gaudry, François Morain