Factorization of a 768-bit RSA modulus T Kleinjung, K Aoki, J Franke, AK Lenstra, E Thomé, JW Bos, P Gaudry, ... Annual Cryptology Conference, 333-350, 2010 | 537 | 2010 |

Constructive and destructive facets of Weil descent on elliptic curves P Gaudry, F Hess, NP Smart Journal of Cryptology 15 (1), 19-46, 2002 | 413 | 2002 |

Imperfect forward secrecy: How Diffie-Hellman fails in practice D Adrian, K Bhargavan, Z Durumeric, P Gaudry, M Green, JA Halderman, ... Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications …, 2015 | 401 | 2015 |

A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic R Barbulescu, P Gaudry, A Joux, E Thomé Annual International Conference on the Theory and Applications of …, 2014 | 299 | 2014 |

An algorithm for solving the discrete log problem on hyperelliptic curves P Gaudry International Conference on the Theory and Applications of Cryptographic …, 2000 | 274 | 2000 |

Counting points on hyperelliptic curves over finite fields P Gaudry, R Harley International Algorithmic Number Theory Symposium, 313-332, 2000 | 199 | 2000 |

A double large prime variation for small genus hyperelliptic index calculus P Gaudry, E Thomé, N Thériault, C Diem Mathematics of computation 76 (257), 475-492, 2007 | 172 | 2007 |

Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem P Gaudry Journal of Symbolic Computation 44 (12), 1690-1702, 2009 | 162* | 2009 |

A general framework for subexponential discrete logarithm algorithms A Enge, P Gaudry | 146 | 2002 |

Fast genus 2 arithmetic based on Theta functions P Gaudry Journal of Mathematical Cryptology JMC 1 (3), 243-265, 2007 | 127 | 2007 |

An extension of Satoh's algorithm and its implementation M Fouquet, P Gaudry, R Harley | 115 | 2000 |

Speeding up the discrete log computation on curves with automorphisms I Duursma, P Gaudry, F Morain International Conference on the Theory and Application of Cryptology and …, 1999 | 115 | 1999 |

Linear recurrences with polynomial coefficients and application to integer factorization and Cartier–Manin operator A Bostan, P Gaudry, É Schost SIAM Journal on Computing 36 (6), 1777-1806, 2007 | 89 | 2007 |

Construction of secure random curves of genus 2 over prime fields P Gaudry, É Schost International Conference on the Theory and Applications of Cryptographic …, 2004 | 86 | 2004 |

Genus 2 point counting over prime fields P Gaudry, É Schost Journal of Symbolic Computation 47 (4), 368-400, 2012 | 76 | 2012 |

An extension of Kedlaya’s point-counting algorithm to superelliptic curves P Gaudry, N Gürel International Conference on the Theory and Application of Cryptology and …, 2001 | 73 | 2001 |

Faster Multiplication in GF(2)[*x*]RP Brent, P Gaudry, E Thomé, P Zimmermann International Algorithmic Number Theory Symposium, 153-166, 2008 | 69 | 2008 |

Recent progress on the elliptic curve discrete logarithm problem SD Galbraith, P Gaudry Designs, Codes and Cryptography 78 (1), 51-72, 2016 | 68 | 2016 |

Improving NFS for the discrete logarithm problem in non-prime finite fields R Barbulescu, P Gaudry, A Guillevic, F Morain Annual International Conference on the Theory and Applications of …, 2015 | 63 | 2015 |

The 2-adic CM method for genus 2 curves with application to cryptography P Gaudry, T Houtmann, D Kohel, C Ritzenthaler, A Weng International Conference on the Theory and Application of Cryptology and …, 2006 | 63 | 2006 |