Skip to Main content Skip to Navigation

hal-02066930v1  Conference papers
Véronique CortierPierrick GaudryStephane Glondu. Belenios: a simple private and verifiable electronic voting system
Foundations of Security, Protocols, and Equational Reasoning, 2019, Fredericksburg, Virgina, United States. pp.214-238, ⟨10.1007/978-3-030-19052-1_14⟩
hal-03691141v1  Journal articles
Fabrice BoudotPierrick GaudryAurore GuillevicNadia HeningerEmmanuel Thomé et al.  The State of the Art in Integer Factoring and Breaking Public-Key Cryptography
IEEE Security and Privacy Magazine, Institute of Electrical and Electronics Engineers, 2022, 20 (2), pp.80-86. ⟨10.1109/MSEC.2022.3141918⟩
inria-00512791v1  Journal articles
Mireille FouquetPierrick GaudryRobert Harley. An extension of Satoh's algorithm and its implementation
Journal of the Ramanujan Mathematical Society, Ramanujan Mathematical Society, 2000, 15, pp.281-318
inria-00498705v1  Conference papers
Jérémie DetreyPierrick GaudryKarim Khalfallah. A low-area yet performant FPGA implementation of Shabal
17th International Workshop on Selected Areas in Cryptography, SAC 2010, Aug 2010, Waterloo, Canada. pp.99-113, ⟨10.1007/978-3-642-19574-7_7⟩
inria-00000625v2  Journal articles
Pierrick Gaudry. Fast genus 2 arithmetic based on Theta functions
Journal of Mathematical Cryptology, De Gruyter, 2007, 1 (3), pp.243-265. ⟨10.1515/JMC.2007.012⟩
hal-00641592v1  Journal articles
Pierrick GaudryEmmanuel ThoméPaul Zimmermann. RSA : la fin des clés de 768 bits
Techniques de l'Ingenieur, Techniques de l'ingénieur, 2011
inria-00168429v1  Conference papers
Pierrick GaudryEmmanuel Thomé. The mpFq library and implementing curve-based key exchanges
SPEED: Software Performance Enhancement for Encryption and Decryption, ECRYPT Network of Excellence in Cryptology, Jun 2007, Amsterdam, Netherlands. pp.49-64
inria-00612418v1  Conference papers
Véronique CortierJérémie DetreyPierrick GaudryFrédéric SurEmmanuel Thomé et al.  Ballot stuffing in a postal voting system
2011 International Workshop on Requirements Engineering for Electronic Voting Systems (REVOTE 2011), 2011, Trento, Italy. pp.27 - 36, ⟨10.1109/REVOTE.2011.6045913⟩
hal-01215623v1  Journal articles
Steven GalbraithPierrick Gaudry. Recent progress on the elliptic curve discrete logarithm problem
Designs, Codes and Cryptography, Springer Verlag, 2016, 78 (1), pp.51-72. ⟨10.1007/s10623-015-0146-7⟩
hal-01184171v2  Conference papers
David AdrianKarthikeyan BhargavanZakir DurumericPierrick GaudryMatthew Green et al.  Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice
CCS '15: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Oct 2015, Denver, Colorado, United States. pp.5-17, ⟨10.1145/2810103.2813707⟩
inria-00001009v1  Conference papers
Pierrick GaudryFrançois Morain. Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm
ISSAC '06: Proceedings of the 2006 international symposium on symbolic and algebraic computation, Jul 2006, Genoa, Italy, pp.109 - 115, ⟨10.1145/1145768.1145791⟩
inria-00444693v2  Conference papers
Thorsten KleinjungKazumaro AokiJens FrankeArjen K. LenstraEmmanuel Thomé et al.  Factorization of a 768-bit RSA modulus
Advances in Cryptology – CRYPTO 2010, Aug 2010, Santa Barbara, United States. pp.333-350, ⟨10.1007/978-3-642-14623-7_18⟩
inria-00103433v1  Conference papers
Olivier ChevassutPierre-Alain FouquePierrick GaudryDavid Pointcheval. The Twist-AUgmented technique for key exchange
9th International Conference on Theory and Practice of Public Key Cryptology - PKC 2006, Apr 2006, New York, USA, pp.410-426
inria-00000627v1  Journal articles
Pierrick GaudryEric Schost. Modular equations for hyperelliptic curves
Mathematics of Computation, American Mathematical Society, 2005, 74, pp.429-454
hal-02266264v2  Conference papers
Pierrick GaudryAlexander Golovnev. Breaking the encryption scheme of the Moscow Internet voting system
Financial Cryptography and Data Security, 2020, Kota Kinabalu, Malaysia. pp.32-49, ⟨10.1007/978-3-030-51280-4_3⟩
hal-00818124v3  Conference papers
Razvan BarbulescuCyril BouvierJérémie DetreyPierrick GaudryHamza Jeljeli et al.  Discrete logarithm in GF($2^{809}$) with FFS
Public-Key Cryptography – PKC 2014, 2014, Buenos Aires, Argentina. ⟨10.1007/978-3-642-54631-0_13⟩
inria-00000626v1  Book sections
Pierrick Gaudry. Chapter 7: Hyperelliptic curves and the HCDLP
I. Blake and G. Seroussi and N. Smart. Advances in Elliptic Curve Cryptography, 317 (317), Cambridge University Press, 2005, London Mathematical Society Lecture Note Series