The SCEAS System
Navigation Menu

Search the dblp DataBase


Pierrick Gaudry: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pierrick Gaudry, Éric Schost
    On the Invariants of the Quotients of the Jacobian of a Curve of Genus 2. [Citation Graph (0, 0)][DBLP]
    AAECC, 2001, pp:373-386 [Conf]
  2. Pierrick Gaudry, Robert Harley
    Counting Points on Hyperelliptic Curves over Finite Fields. [Citation Graph (0, 0)][DBLP]
    ANTS, 2000, pp:313-332 [Conf]
  3. Pierrick Gaudry, Éric Schost
    A Low-Memory Parallel Version of Matsuo, Chao, and Tsujii?s Algorithm. [Citation Graph (0, 0)][DBLP]
    ANTS, 2004, pp:208-222 [Conf]
  4. Iwan M. Duursma, Pierrick Gaudry, François Morain
    Speeding up the Discrete Log Computation on Curves with Automorphisms. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1999, pp:103-121 [Conf]
  5. Pierrick Gaudry
    A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2002, pp:311-327 [Conf]
  6. Pierrick Gaudry, Nicolas Gürel
    An Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2001, pp:480-494 [Conf]
  7. Pierrick Gaudry, T. Houtmann, D. Kohel, Christophe Ritzenthaler, A. Weng
    The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2006, pp:114-129 [Conf]
  8. Pierrick Gaudry
    An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2000, pp:19-34 [Conf]
  9. Pierrick Gaudry, Éric Schost
    Construction of Secure Random Curves of Genus 2 over Prime Fields. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2004, pp:239-256 [Conf]
  10. Mireille Fouquet, Pierrick Gaudry, Robert Harley
    Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2001, pp:14-29 [Conf]
  11. Alin Bostan, Pierrick Gaudry, Éric Schost
    Linear Recurrences with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves. [Citation Graph (0, 0)][DBLP]
    International Conference on Finite Fields and Applications, 2003, pp:40-58 [Conf]
  12. Pierrick Gaudry, François Morain
    Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2006, pp:109-115 [Conf]
  13. Olivier Chevassut, Pierre-Alain Fouque, Pierrick Gaudry, David Pointcheval
    The Twist-AUgmented Technique for Key Exchange. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2006, pp:410-426 [Conf]
  14. Pierrick Gaudry, Éric Schost, Nicolas M. Thiéry
    Evaluation Properties of Symmetric Polynomials. [Citation Graph (0, 0)][DBLP]
    IJAC, 2006, v:16, n:3, pp:505-524 [Journal]
  15. Pierrick Gaudry, Florian Hess, Nigel P. Smart
    Constructive and Destructive Facets of Weil Descent on Elliptic Curves. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2002, v:15, n:1, pp:19-46 [Journal]
  16. Alin Bostan, Pierrick Gaudry, Éric Schost
    Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier-Manin Operator. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:6, pp:1777-1806 [Journal]
  17. Andreas Enge, Pierrick Gaudry
    An L (1/3 + epsilon ) Algorithm for the Discrete Logarithm Problem for Low Degree Curves. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2007, pp:379-393 [Conf]
  18. Pierrick Gaudry, Alexander Kruppa, Paul Zimmermann
    A gmp-based implementation of schönhage-strassen's large integer multiplication algorithm. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2007, pp:167-174 [Conf]
  19. Andreas Enge, Pierrick Gaudry
    An L(1/3 + epsilon) Algorithm for the Discrete Logarithm Problem for Low Degree Curves [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  20. Faster Multiplication in GF(2)[x]. [Citation Graph (, )][DBLP]

  21. Factorization of a 768-Bit RSA Modulus. [Citation Graph (, )][DBLP]

  22. An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves [Citation Graph (, )][DBLP]

Search in 0.004secs, Finished in 0.005secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002