Cryptographers' World
 

Pierrick Gaudry


Author's Web Page Link

10 papers in database with 607 citations Star

H-number: 9

Journal Papers

[Sort papers chronologically] [Sort papers by citations count]

 
1. Pierrick Gaudry,  Florian Hess,  Nigel P. Smart,  Constructive and Destructive Facets of Weil Descent on Elliptic Curves, Journal of Cryptology, Volume 15(1), pp. 19 - 46, Springer, 2002.

[Cited 203 times Red StarRed Star]

Conference Papers

[Sort papers chronologically] [Sort papers by citations count]

1. Andreas Enge,  Pierrick Gaudry,  An L (1/3 + epsilon ) Algorithm for the Discrete Logarithm Problem for Low Degree Curves, pp. 379 - 393, EUROCRYPT 2007.

[Electronic Edition][Cited 6 times ]

2. Olivier Chevassut,  Pierre-Alain Fouque,  Pierrick Gaudry,  David Pointcheval,  The Twist-AUgmented Technique for Key Exchange, pp. 410 - 426, PKC 2006.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 31 times ]

3. Pierrick Gaudry,  T. Houtmann,  David R. Kohel,  Christophe Ritzenthaler,  A. Weng,  The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography, pp. 114 - 129, ASIACRYPT 2006.

[Electronic Edition][Cited 17 times ]

4. Pierrick Gaudry,  Ã‰ric Schost,  Construction of Secure Random Curves of Genus 2 over Prime Fields, pp. 239 - 256, EUROCRYPT 2004.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 52 times Red Star]

5. Pierrick Gaudry,  A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2, pp. 311 - 327, ASIACRYPT 2002.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 27 times ]

6. Pierrick Gaudry,  Nicolas Gürel,  An Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves, pp. 480 - 494, ASIACRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 32 times ]

7. Mireille Fouquet,  Pierrick Gaudry,  Robert Harley,  Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy, pp. 14 - 29, EUROCRYPT 2001.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 20 times ]

8. Pierrick Gaudry,  An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves, pp. 19 - 34, EUROCRYPT 2000.

[Electronic Edition][IACR Online ArchiveIACR Online Archive][Cited 154 times Red StarRed Star]

9. Iwan M. Duursma,  Pierrick Gaudry,  François Morain,  Speeding up the Discrete Log Computation on Curves with Automorphisms, pp. 103 - 121, ASIACRYPT 1999.

[Electronic Edition][Cited 65 times Red Star]



Database status:
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals
Highly Cited...