Nombre de documents


CV de Pierrick Gaudry

Communication dans un congrès29 documents

  • Razvan Barbulescu, Pierrick Gaudry, Thorsten Kleinjung. The Tower Number Field Sieve. Tetsu Iwata and Jung Hee Cheon. ASIACRYPT 2015, Nov 2015, Auckland, New Zealand. Springer, 9453, pp.31-58, 2015, Advances in cryptology-Asiacrypt 2015. <>. <hal-01155635>
  • Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain. Improving NFS for the discrete logarithm problem in non-prime finite fields. Marc Fischlin and Elisabeth Oswald. Eurocrypt 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Apr 2015, Sofia, Bulgaria. Lecture Notes in Computer Sciences, 9056, pp.129-155, 2015, Advances in Cryptology -- EUROCRYPT 2015. <>. <10.1007/978-3-662-46800-5_6>. <hal-01112879v2>
  • David Adrian, Karthikeyan Bhargavan, Zakir Durumeric, Pierrick Gaudry, Matthew Green, et al.. Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice. ACM CCS 2015, Oct 2015, Denver, Colorado, United States. Proceedings of the 2015 ACM SIGSAC Conference on Computer and Communications Security, pp.14, 2015 ACM SIGSAC Conference on Computer and Communications Security. <10.1145/2810103.2813707>. <hal-01184171v2>
  • Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, et al.. Discrete logarithm in GF($2^{809}$) with FFS. Hugo Krawczyk. PKC 2014 - International Conference on Practice and Theory of Public-Key Cryptography, 2014, Buenos Aires, Argentina. Springer, 2014, LNCS. <10.1007/978-3-642-54631-0_13>. <hal-00818124v3>
  • Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault. Sub-cubic Change of Ordering for Gröner Basis: A Probabilistic Approach. ISSAC '14 - 39th International Symposium on Symbolic and Algebraic Computation, Jul 2014, Kobe, Japan. ACM, ISSAC '14 - Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, pp.170--177, 2014, <10.1145/2608628.2608669>. <hal-01064551>
  • Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé. A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. Phong Q. Nguyen and Elisabeth Oswald. Eurocrypt 2014, May 2014, Copenhagen, Denmark. Springer, 8441, pp.1-16, 2014, Advances in Cryptology - EUROCRYPT 2014; Lecture Notes in Computer Science. <10.1007/978-3-642-55220-5_1>. <hal-00835446v2>
  • Jérémie Detrey, Pierrick Gaudry, Marion Videau. Relation collection for the Function Field Sieve. Alberto Nannarelli and Peter-Michael Seidel and Ping Tak Peter Tang. ARITH 21 - 21st IEEE International Symposium on Computer Arithmetic, Apr 2013, Austin, Texas, United States. IEEE, pp.201-210, 2013, ARITH 21. <10.1109/ARITH.2013.28>. <hal-00736123v2>
  • Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault. Using Symmetries and Fast Change of Ordering in the Index Calculus for Elliptic Curves Discrete Logarithm. SCC 2012 - Third international conference on Symbolic Computation and Cryptography, Jul 2012, Castro Urdiales, Spain. pp.113-118, 2012. <hal-00793097>
  • Véronique Cortier, Jérémie Detrey, Pierrick Gaudry, Frédéric Sur, Emmanuel Thomé, et al.. Ballot stuffing in a postal voting system. Revote 2011 - International Workshop on Requirements Engineering for Electronic Voting Systems, 2011, Trento, Italy. IEEE, pp.27 - 36, 2011, <10.1109/REVOTE.2011.6045913>. <inria-00612418>
  • Pierrick Gaudry, David Kohel, Benjamin Smith. Counting Points on Genus 2 Curves with Real Multiplication. Lee, Dong Hoon and Wang, Xiaoyun. ASIACRYPT 2011, Dec 2011, Seoul, South Korea. Springer, 7073, pp.504-519, 2011, Lecture Notes in Computer Science; Advances in Cryptology -- ASIACRYPT 2011. <10.1007/978-3-642-25385-0_27>. <inria-00598029>
  • Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen Lenstra, Emmanuel Thomé, et al.. Factorization of a 768-bit RSA modulus. Tal Rabin. CRYPTO 2010, Aug 2010, Santa Barbara, United States. Springer Verlag, 6223, pp.333-350, 2010, Lecture Notes in Computer Science; Advances in Cryptology - CRYPTO 2010. <10.1007/978-3-642-14623-7_18>. <inria-00444693v2>
  • Jérémie Detrey, Pierrick Gaudry, Karim Khalfallah. A low-area yet performant FPGA implementation of Shabal. Alex Biryukov and Guang Gong and Douglas Stinson. 17th International Workshop on Selected Areas in Cryptography, SAC 2010, Aug 2010, Waterloo, Canada. Springer, 6544, pp.99-113, 2011, Lecture Notes in Computer Science; Selected Areas in Cryptography 17th International Workshop, SAC 2010 Revised Selected Papers. <10.1007/978-3-642-19574-7_7>. <inria-00498705>
  • Richard Brent, Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann. Faster Multiplication in GF(2)[x]. van der Poorten, Alfred and Stein, Andreas. ANTS-VIII, May 2008, Banff, Canada. Springer-Verlag, 5011, pp.153-166, 2008, Lecture notes in computer science; Algorithmic Number Theory, ANTS-VIII. <10.1007/978-3-540-79456-1>. <inria-00188261v4>
  • Pierrick Gaudry, Alexander Kruppa, Paul Zimmermann. A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm. C. W. Brown. ISSAC 2007, Jul 2007, Waterloo, Ontario, Canada. ACM Press, pp.167-174, 2007, Proceedings of the 2007 international symposium on Symbolic and algebraic computation. <10.1145/1277548.1277572>. <inria-00126462v2>
  • Pierrick Gaudry, Emmanuel Thomé. The mpFq library and implementing curve-based key exchanges. SPEED: Software Performance Enhancement for Encryption and Decryption, Jun 2007, Amsterdam, Netherlands. pp.49-64, 2007. <inria-00168429>
  • Andreas Enge, Pierrick Gaudry. An $L (1/3 + \varepsilon)$ Algorithm for the Discrete Logarithm Problem for Low Degree Curves. Moni Naor. Eurocrypt 2007, May 2007, Barcelona, Spain. Springer, 4515, pp.379-393, 2007, Lecture Notes in Computer Science; Advances in Cryptology - EUROCRYPT 2007. <inria-00135324>
  • Olivier Chevassut, Pierre-Alain Fouque, Pierrick Gaudry, David Pointcheval. The Twist-AUgmented technique for key exchange. M. Yung, Y. Dodis, Kiayias, T. Malkin. 9th International Conference on Theory and Practice of Public Key Cryptology - PKC 2006, Apr 2006, New York, USA, Springer-Verlag, 3958, pp.410-426, 2006, Lecture notes in computer science. <inria-00103433>
  • Pierrick Gaudry, Thomas Houtmann, David Kohel, Christophe Ritzenthaler, Annegret Weng. The 2-adic CM method for genus 2 curves with application to cryptography. X. Lay and K. Chen. Asiacrypt 2006, Dec 2006, Shangai, China. Springer-Verlag, 4284, pp.114-129, 2006, Lecture notes in computer science. <inria-00103435>
  • Pierrick Gaudry, François Morain. Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm. Jean-Guillaume Dumas. ISSAC '06: Proceedings of the 2006 international symposium on symbolic and algebraic computation, Jul 2006, Genoa, Italy, ACM Press, pp.109 - 115, 2006, <10.1145/1145768.1145791>. <inria-00001009>
  • Pierrick Gaudry, Eric Schost. Construction of secure random curves of genus 2 over prime fields. Christian Cachin and Jan Camenisch. Eurocrypt, 2004, Interlaken, Switzerland. Springer Verlag, 3027, pp.239-256, 2004, LNCS; Advances in Cryptology - EUROCRYPT 2004. <10.1007/978-3-540-24676-3_15>. <inria-00514121>
  • Alin Bostan, Pierrick Gaudry, Éric Schost. Linear recurrences with polynomial coefficients and computation of the Cartier-Manin operator on hyperelliptic curves. Gary L. Mullen and Alain Poli and Henning Stichtenoth. Finite Fields and Applications - Fq7, 2004, Toulouse, France. Springer Verlag, 2948, pp.40-58, 2004, LNCS; Finite Fields and Applications. <10.1007/978-3-540-24633-6_4>. <inria-00514132>
  • Pierrick Gaudry, Eric Schost. A low-memory parallel version of Matsuo, Chao and Tsujii's algorithm. Duncan Buell. ANTS-VI, 2004, Burlington, United States. Springer Verlag, 3076, pp.208-222, 2004, LNCS; Algorithmic Number Theory. <10.1007/978-3-540-24847-7_15>. <inria-00514089>
  • Pierrick Gaudry. A comparison and a combination of SST and AGM algorithms for counting points of elliptic curves in characteristic 2. Yuliang Zheng. Asiacrypt, 2002, Queenstown, New Zealand. Springer Verlag, 2501, pp.621-628, 2002, LNCS; Advances in Cryptology - ASIACRYPT 2002. <10.1007/3-540-36178-2_20>. <inria-00514137>
  • Pierrick Gaudry, Éric Schost. On the invariants of the quotients of the Jacobian of a curve of genus 2. Serdar Boztas and Igor E. Shparlinski. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 14, Nov 2001, Melbourne, Australia. Springer Verlag, 2227, pp.373-386, 2001, Lecture Notes in Computer Science; Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 14th International Symposium, AAECC-14. <10.1007/3-540-45624-4_39>. <inria-00514434>
  • Mireille Fouquet, Pierrick Gaudry, Robert Harley. Finding secure curves with the Satoh-FGH algorithm and an early-abort strategy. Birgit Pfitzman. Eurocrypt, 2001, Innsbruck, Austria. Springer Verlag, 2045, pp.14-29, 2000, LNCS; Advances in Cryptology - EUROCRYPT 2001. <10.1007/3-540-44987-6_2>. <inria-00514426>
  • Pierrick Gaudry, Nicolas Gürel. An extension of Kedlaya's algorithm to superelliptic curves. Colin Boyd. Asiacrypt, 2001, Gold Coast, Australia. Springer Verlag, 2248, pp.480-494, 2001, LNCS; Advances in Cryptology - ASIACRYPT 2001. <10.1007/3-540-45682-1_28>. <inria-00514826>
  • Pierrick Gaudry. An algorithm for solving the discrete log problem on hyperelliptic curves. Bart Preneel. Eurocrypt, 2000, Bruges, Belgium. Springer Verlag, 1807, pp.19-34, 2000, LNCS; Advances in Cryptology - EUROCRYPT 2000. <10.1007/3-540-45539-6_2>. <inria-00512401>
  • Pierrick Gaudry, Robert Harley. Counting points on hyperelliptic curves over finite fields. Wieb Bosma. ANTS-IV, 2000, Leiden, Netherlands. Springer Verlag, 1838, pp.313-332, 2000, LNCS; Algorithmic Number Theory. <10.1007/10722028_18>. <inria-00512403>
  • Iwan Duursma, Pierrick Gaudry, François Morain. Speeding up the discrete log computation on curves with automorphisms. Kwok-Yan Lam and Eiji Okamoto and Chaoping Xing. Asiacrypt, 1999, Singapour, Singapore. Springer Verlag, 1716, pp.103-121, 1999, LNCS; Advances in Cryptology - ASIACRYPT 1999. <inria-00511639>

Article dans une revue18 documents

Chapitre d'ouvrage2 documents

  • Pierrick Gaudry. Algorithmes de comptage de points d'une courbe définie sur un corps fini. Karim Belabas. Explicit Methods in Number Theory Rational Points and Diophantine Equations, 36, SMF, 2013, Panoramas et synthèses. <hal-00840136>
  • 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. <inria-00000626>

Pré-publication, Document de travail6 documents

  • 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. 2016. <hal-01299697>
  • Joshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé. A kilobit hidden SNFS discrete logarithm computation. 2016. <hal-01376934>
  • Shi Bai, Pierrick Gaudry, Alexander Kruppa, Emmanuel Thomé, Paul Zimmermann. Factorisation of RSA-220 with CADO-NFS. 2016. <hal-01315738>
  • Pierrick Gaudry. Integer factorization and discrete logarithm problems. Notes d'un cours donné aux Journées Nationales de Calcul Formel. 2014. <hal-01215553>
  • Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain. Improvements to the number field sieve for non-prime finite fields. 2014. <hal-01052449v4>
  • Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault. Polynomial Systems Solving by Fast Linear Algebra. 27 pages. 2013. <hal-00816724v2>

Direction d'ouvrage, Proceedings1 document

  • Karim Belabas, Frits Beukers, Pierrick Gaudry, William Mccallum, Bjorn Poonen, et al.. Explicit methods in number theory. Rational points and Diophantine equations.. France. SMF, pp.xxi + 179, 2012, 978-2-85629-359-1/pbk. <hal-00932377>

Thèse1 document

  • Pierrick Gaudry. Algorithmique des courbes hyperelliptiques et applications à la cryptologie. Génie logiciel [cs.SE]. Ecole Polytechnique X, 2000. Français. <tel-00514848>

HDR1 document

  • Pierrick Gaudry. Algorithmique des courbes algébriques pour la cryptologie. Génie logiciel [cs.SE]. Université Henri Poincaré - Nancy I, 2008. <tel-00514843>

Rapport2 documents

  • Pierrick Gaudry, Emmanuel Thomé, Nicolas Thériault, Claus Diem. A double large prime variation for small genus hyperelliptic index calculus. [Research Report] RR-5764, INRIA. 2005. <inria-00077334>
  • Pierrick Gaudry, Nicolas Gürel. Counting points in medium characteristic using Kedlaya's algorithm. [Research Report] RR-4838, INRIA. 2003. <inria-00071747>