1. Alin Bostan, Pierrick Gaudry, and Éric Schost, Linear recurrences with polynomial coefficients and computation of the Cartier-Manin operator on hyperelliptic curves, Finite Fields and Applications, Lecture Notes in Comput. Sci., vol. 2948, Springer, Berlin, 2004, pp. 40–58.[MR]
  2. I. Duursma, P. Gaudry, and F. Morain, Speeding up the discrete log computation on curves with automorphisms, Advances in Cryptology—Asiacrypt'99 (Singapore), Lecture Notes in Comput. Sci., vol. 1716, Springer, Berlin, 1999, pp. 103–121.[MR]
  3. P. Gaudry, Fast genus 2 arithmetic based on theta functions, J. Ramanujan Math. Soc. (2005), no. 4, 20 pages.
  4. P. Gaudry, F. Hess, and N. P. Smart, Constructive and destructive facets of Weil descent on elliptic curves, J. Cryptology 15 (2002), no. 1, 19–46.[MR]
  5. P. Gaudry, T. Houtmann, D. Kohel, C. Ritzenthaler, and A. Weng, The 2-adic CM method for genus 2 curves with application to cryptography, Advances in cryptology—ASIACRYPT 2006, Lecture Notes in Comput. Sci., vol. 4284, Springer, Berlin, 2006, pp. 114–129.[MR]
  6. P. Gaudry and É. Schost, On the invariants of the quotients of the Jacobian of a curve of genus 2, Applied Algebra, Algebraic Algorithms and Error-correcting Codes (Melbourne, 2001), Lecture Notes in Comput. Sci., vol. 2227, Springer, Berlin, 2001, pp. 373–386.[MR]
  7. P. Gaudry and É. Schost, Modular equations for hyperelliptic curves, Math. Comp. 74 (2005), no. 249, 429–454 (electronic).[MR]
  8. Pierrick Gaudry, An algorithm for solving the discrete log problem on hyperelliptic curves, Advances in Cryptology—Eurocrypt 2000 (Bruges), Lecture Notes in Comput. Sci., vol. 1807, Springer, Berlin, 2000, pp. 19–34.[MR]
  9. Pierrick Gaudry, Index calculus for abelian varieties and the elliptic curve discrete logarithm problem, Preprint (2004), 13 pages.
  10. Pierrick Gaudry and Nicolas Gürel, An extension of Kedlaya's point-counting algorithm to superelliptic curves, Advances in Cryptology—Asiacrypt 2001 (Gold Coast), Lecture Notes in Comput. Sci., vol. 2248, Springer, Berlin, 2001, pp. 480–494.[MR]
  11. Pierrick Gaudry and Robert Harley, Counting points on hyperelliptic curves over finite fields, Algorithmic Number Theory (Leiden, 2000), Lecture Notes in Comput. Sci., vol. 1838, Springer, Berlin, 2000, pp. 313–332.[MR]
  12. Pierrick Gaudry, Alexander Kruppa, and Paul Zimmermann, A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm, ISSAC 2007, ACM, New York, 2007, pp. 167–174.[MR]
  13. Pierrick Gaudry and Éric Schost, A low-memory parallel version of Matsuo, Chao, and Tsujii's algorithm, Algorithmic Number Theory, Lecture Notes in Comput. Sci., vol. 3076, Springer, Berlin, 2004, pp. 208–222.[MR]
  14. Pierrick Gaudry and Éric Schost, Construction of secure random curves of genus 2 over prime fields, Advances in Cryptology—EuroCrypt 2004, Lecture Notes in Comput. Sci., vol. 3027, Springer, Berlin, 2004, pp. 239–256.[MR]