World's Best Scientists 2026 revealed!
Pierrick Gaudry

Pierrick Gaudry

D-Index & Metrics

Computer Science

D-Index
32
Citations
5729
World Ranking
12998
National Ranking
331

Overview

Pierrick Gaudry is affiliated with the University of Lorraine in France. Their research focuses primarily on the field of Computer Science, with a particular emphasis on Artificial Intelligence, Information Systems, and related subfields including Sociology and Political Science, Computer Networks and Communications, and Political Science and International Relations.

The scientist's main areas of study revolve around Cryptography and Data Security, Coding Theory and Cryptography, Cryptography and Residue Arithmetic, and Internet Traffic Analysis and Secure E-voting. Other topics include Cryptographic Implementations and Security, Privacy-Preserving Technologies in Data, and User Authentication and Security Systems.

Gaudry's recent publications span several respected venues in the field. These include:

  • The State of the Art in Integer Factoring and Breaking Public-Key Cryptography, 2022, IEEE Security & Privacy
  • Themis, 2022, Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
  • Lattice Enumeration for Tower NFS: A 521-Bit Discrete Logarithm Computation, 2021, Lecture notes in computer science
  • Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment, 2020, HAL (Le Centre pour la Communication Scientifique Directe)
  • Table of Contents, 2022, IEEE Security & Privacy

Frequent publication venues for their work include:

  • IEEE Security & Privacy
  • arXiv (Cornell University)
  • Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
  • Lecture notes in computer science
  • HAL (Le Centre pour la Communication Scientifique Directe)

Gaudry collaborates regularly with several co-authors in their research. The most frequent collaborators include:

  • Paul Zimmermann
  • Véronique Cortier
  • Fabrice Boudot
  • Aurore Guillevic
  • Nadia Heninger

Best Publications

  • Factorization of a 768-bit RSA modulus.

    Thorsten Kleinjung;Kazumaro Aoki;Jens Franke;Arjen K. Lenstra

  • Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice

    David Adrian;Karthikeyan Bhargavan;Zakir Durumeric;Pierrick Gaudry

  • Constructive and destructive facets of Weil descent on elliptic curves

    P. Gaudry;F. Hess;N. P. Smart

  • A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic

    Razvan Barbulescu;Pierrick Gaudry;Antoine Joux;Emmanuel Thomé

  • An algorithm for solving the discrete log problem on hyperelliptic curves

    Pierrick Gaudry

  • Counting Points on Hyperelliptic Curves over Finite Fields

    Pierrick Gaudry;Robert Harley

  • A double large prime variation for small genus hyperelliptic index calculus

    Pierrick Gaudry;Emmanuel Thomé;Nicolas Thériault;Claus Diem

  • Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem

    Pierrick Gaudry

  • A general framework for subexponential discrete logarithm algorithms

    Andreas Enge;Pierrick Gaudry

  • Fast genus 2 arithmetic based on Theta functions

    Pierrick Gaudry

  • Recent progress on the elliptic curve discrete logarithm problem

    Steven D. Galbraith;Pierrick Gaudry

  • Speeding up the Discrete Log Computation on Curves with Automorphisms

    I. Duursma;Pierrick Gaudry;François Morain

  • An extension of Satoh's algorithm and its implementation

    Mireille Fouquet;Pierrick Gaudry;Robert Harley

  • Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier-Manin Operator

    Alin Bostan;Pierrick Gaudry;E´ric Schost

  • Genus 2 point counting over prime fields

    Pierrick Gaudry;Éric Schost

  • Construction of secure random curves of genus 2 over prime fields

    Pierrick Gaudry;Eric Schost

  • Improving NFS for the discrete logarithm problem in non-prime finite fields.

    Razvan Barbulescu;Pierrick Gaudry;Aurore Guillevic;François Morain

  • Faster multiplication in GF(2)[x]

    Richard P. Brent;Pierrick Gaudry;Emmanuel Thomé;Paul Zimmermann

  • An Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves

    Pierrick Gaudry;Nicolas Gürel

  • The 2-adic CM method for genus 2 curves with application to cryptography

    P. Gaudry;T. Houtmann;D. Kohel;C. Ritzenthaler

Frequent Co-Authors

Véronique Cortier
Véronique Cortier Centre national de la recherche scientifique, CNRS
Jean-Charles Faugère
Jean-Charles Faugère French Institute for Research in Computer Science and Automation - INRIA
Antoine Joux
Antoine Joux Université Paris Cité
Karthikeyan Bhargavan
Karthikeyan Bhargavan French Institute for Research in Computer Science and Automation - INRIA
Steven D. Galbraith
Steven D. Galbraith University of Auckland
Matthew Green
Matthew Green Johns Hopkins University
Arjen K. Lenstra
Arjen K. Lenstra École Polytechnique Fédérale de Lausanne
J. Alex Halderman
J. Alex Halderman University of Michigan–Ann Arbor
Serge Vaudenay
Serge Vaudenay École Polytechnique Fédérale de Lausanne
Bogdan Warinschi
Bogdan Warinschi University of Bristol

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring a career in Computer Science opens numerous educational and professional opportunities, both on-campus and online. For those seeking affordability, you might consider the cheapest data science masters in USA, which can help reduce financial burden while advancing your expertise.

If you're interested in a related technical field, there are many reputable online electrical engineering courses USA available. These can expand your skill set and prepare you for a diverse range of engineering roles.

Certifications can also play a crucial role in your career journey. There are several certifications for jobs that are easy to obtain and can lead to high-paying positions in tech and other growing industries.

For those who wish to accelerate their education, consider pursuing one of the shortest online masters degree programs. These condensed programs allow you to quickly gain credentials and enter the workforce or advance your current career path.

Best Scientists Citing Pierrick Gaudry

Trending Scientists

Recently Published Articles