Pierrick Gaudry

4.3k total citations
29 papers, 738 citations indexed

About

Pierrick Gaudry is a scholar working on Information Systems, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, Pierrick Gaudry has authored 29 papers receiving a total of 738 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Information Systems, 22 papers in Artificial Intelligence and 12 papers in Geometry and Topology. Recurrent topics in Pierrick Gaudry's work include Cryptography and Residue Arithmetic (23 papers), Coding theory and cryptography (19 papers) and Algebraic Geometry and Number Theory (12 papers). Pierrick Gaudry is often cited by papers focused on Cryptography and Residue Arithmetic (23 papers), Coding theory and cryptography (19 papers) and Algebraic Geometry and Number Theory (12 papers). Pierrick Gaudry collaborates with scholars based in France, Austria and United States. Pierrick Gaudry's co-authors include Nigel P. Smart, Steven D. Galbraith⋆, Éric Schost, Emmanuel Thomé, Marc Jóye, Elisabeth Oswald, Andreas Enge, Fréderik Vercauteren, Daniel W. Brown and Alexander W. Dent and has published in prestigious journals such as Communications of the ACM, Mathematics of Computation and IEEE Transactions on Computers.

In The Last Decade

Pierrick Gaudry

28 papers receiving 636 citations

Peers

Pierrick Gaudry
Pierrick Gaudry
Citations per year, relative to Pierrick Gaudry Pierrick Gaudry (= 1×) peers Kazuhiro Yokoyama

Countries citing papers authored by Pierrick Gaudry

Since Specialization
Citations

This map shows the geographic impact of Pierrick Gaudry's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Pierrick Gaudry with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pierrick Gaudry more than expected).

Fields of papers citing papers by Pierrick Gaudry

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Pierrick Gaudry. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Pierrick Gaudry. The network helps show where Pierrick Gaudry may publish in the future.

Co-authorship network of co-authors of Pierrick Gaudry

This figure shows the co-authorship network connecting the top 25 collaborators of Pierrick Gaudry. A scholar is included among the top collaborators of Pierrick Gaudry based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Pierrick Gaudry. Pierrick Gaudry is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Boudot, Fabrice, Pierrick Gaudry, Aurore Guillevic, et al.. (2022). The State of the Art in Integer Factoring and Breaking Public-Key Cryptography. IEEE Security & Privacy. 20(2). 80–86. 10 indexed citations
2.
Chabanne, Hervé, Véronique Cortier, Emmanuelle Dottax, et al.. (2022). Themis. Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. 397–410. 3 indexed citations
3.
Adrian, David, Karthikeyan Bhargavan, Zakir Durumeric, et al.. (2018). Imperfect forward secrecy. Communications of the ACM. 62(1). 106–114. 7 indexed citations
4.
Gaudry, Pierrick, et al.. (2018). Improved Complexity Bounds for Counting Points on Hyperelliptic Curves. Foundations of Computational Mathematics. 19(3). 591–621.
5.
Ishii, Masahiro, Jérémie Detrey, Pierrick Gaudry, Atsuo Inomata, & Kazutoshi Fujikawa. (2017). Fast Modular Arithmetic on the Kalray MPPA-256 Processor for an Energy-Efficient Implementation of ECM. IEEE Transactions on Computers. 66(12). 2019–2030. 7 indexed citations
6.
Gaudry, Pierrick, et al.. (2016). Collecting relations for the number field sieve in. LMS Journal of Computation and Mathematics. 19(A). 332–350. 4 indexed citations
7.
Galbraith⋆, Steven D. & Pierrick Gaudry. (2015). Recent progress on the elliptic curve discrete logarithm problem. Designs Codes and Cryptography. 78(1). 51–72. 60 indexed citations
8.
Gaudry, Pierrick. (2014). Integer factorization and discrete logarithm problems. 4(1). 1–20. 4 indexed citations
9.
Gaudry, Pierrick, et al.. (2013). Fast change of ordering with exponent ω. ACM communications in computer algebra. 46(3/4). 92–93. 1 indexed citations
10.
Faugère, Jean‐Charles, et al.. (2013). Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm. Journal of Cryptology. 27(4). 595–635. 7 indexed citations
11.
Gaudry, Pierrick & Éric Schost. (2011). Genus 2 point counting over prime fields. Journal of Symbolic Computation. 47(4). 368–400. 17 indexed citations
12.
Enge, Andreas, Pierrick Gaudry, & Emmanuel Thomé. (2010). An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves. Journal of Cryptology. 24(1). 24–41. 4 indexed citations
13.
Gaudry, Pierrick & David Lubicz. (2009). The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines. Finite Fields and Their Applications. 15(2). 246–260. 13 indexed citations
14.
Gaudry, Pierrick. (2008). Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem. Journal of Symbolic Computation. 44(12). 1690–1702. 27 indexed citations
15.
Gaudry, Pierrick. (2007). Fast genus 2 arithmetic based on Theta functions. Journal of Mathematical Cryptology. 1(3). 243–265. 36 indexed citations
16.
Gaudry, Pierrick & Emmanuel Thomé. (2007). The mpFq library and implementing curve-based key exchanges. SPIRE - Sciences Po Institutional REpository. 49–64. 18 indexed citations
17.
Gaudry, Pierrick, Emmanuel Thomé, Nicolas Thériault, & Claus Diem. (2006). A double large prime variation for small genus hyperelliptic index calculus. Mathematics of Computation. 76(257). 475–493. 45 indexed citations
18.
Gaudry, Pierrick, Éric Schost, & Nicolas M. Thiéry. (2006). EVALUATION PROPERTIES OF SYMMETRIC POLYNOMIALS. International Journal of Algebra and Computation. 16(3). 505–523. 5 indexed citations
19.
Enge, Andreas & Pierrick Gaudry. (2002). A general framework for subexponential discrete logarithm algorithms. Acta Arithmetica. 102(1). 83–103. 39 indexed citations
20.
Gaudry, Pierrick, et al.. (2000). An extension of Satoh's algorithm and its implementation. Parasitology. 15(5). 281–318. 20 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026