Emmanuel Thomé

1.8k total citations
20 papers, 194 citations indexed

About

Emmanuel Thomé is a scholar working on Artificial Intelligence, Information Systems and Computational Theory and Mathematics. According to data from OpenAlex, Emmanuel Thomé has authored 20 papers receiving a total of 194 indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Artificial Intelligence, 10 papers in Information Systems and 6 papers in Computational Theory and Mathematics. Recurrent topics in Emmanuel Thomé's work include Coding theory and cryptography (12 papers), Cryptography and Residue Arithmetic (10 papers) and Polynomial and algebraic computation (5 papers). Emmanuel Thomé is often cited by papers focused on Coding theory and cryptography (12 papers), Cryptography and Residue Arithmetic (10 papers) and Polynomial and algebraic computation (5 papers). Emmanuel Thomé collaborates with scholars based in France, United States and Germany. Emmanuel Thomé's co-authors include Pierrick Gaudry, Claus Diem, Nicolas Thériault, Aurore Guillevic, Andreas Enge, Thorsten Kleinjung, Paul Zimmermann, Shi Bai, Lucas Nussbaum and Richard P. Brent and has published in prestigious journals such as Communications of the ACM, Mathematics of Computation and IEEE Security & Privacy.

In The Last Decade

Emmanuel Thomé

19 papers receiving 173 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Emmanuel Thomé France 8 133 122 58 56 25 20 194
Andreas Enge France 9 207 1.6× 189 1.5× 72 1.2× 111 2.0× 31 1.2× 20 281
Victor S. Miller United States 4 249 1.9× 204 1.7× 56 1.0× 67 1.2× 35 1.4× 8 307
Renate Scheidler Canada 7 132 1.0× 82 0.7× 48 0.8× 82 1.5× 4 0.2× 37 176
Edlyn Teske Canada 10 297 2.2× 261 2.1× 87 1.5× 85 1.5× 36 1.4× 14 367
Abderrahmane Nitaj France 8 107 0.8× 73 0.6× 15 0.3× 15 0.3× 23 0.9× 39 162
Benny Godlin Israel 5 76 0.6× 55 0.5× 91 1.6× 22 0.4× 18 0.7× 9 164
Takeshi Shimoyama Japan 6 121 0.9× 40 0.3× 103 1.8× 39 0.7× 11 0.4× 28 205
Young-Ho Park South Korea 8 143 1.1× 119 1.0× 14 0.2× 38 0.7× 98 3.9× 45 224
Jerome A. Solinas United States 4 165 1.2× 167 1.4× 19 0.3× 39 0.7× 14 0.6× 7 197
Jonathan Sorenson United States 9 146 1.1× 93 0.8× 80 1.4× 42 0.8× 5 0.2× 25 222

Countries citing papers authored by Emmanuel Thomé

Since Specialization
Citations

This map shows the geographic impact of Emmanuel Thomé'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 Emmanuel Thomé with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Emmanuel Thomé more than expected).

Fields of papers citing papers by Emmanuel Thomé

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Emmanuel Thomé. 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 Emmanuel Thomé. The network helps show where Emmanuel Thomé may publish in the future.

Co-authorship network of co-authors of Emmanuel Thomé

This figure shows the co-authorship network connecting the top 25 collaborators of Emmanuel Thomé. A scholar is included among the top collaborators of Emmanuel Thomé 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 Emmanuel Thomé. Emmanuel Thomé 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.
Guillevic, Aurore, et al.. (2020). Cocks–Pinch curves of embedding degrees five to eight and optimal ate pairing computation. Designs Codes and Cryptography. 88(6). 1047–1081. 18 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.
Thomé, Emmanuel, et al.. (2016). Fast integer multiplication using generalized Fermat primes. HAL (Le Centre pour la Communication Scientifique Directe). 6 indexed citations
5.
Thomé, Emmanuel, et al.. (2016). Computing theta functions in quasi-linear time in genus two and above. LMS Journal of Computation and Mathematics. 19(A). 163–177. 5 indexed citations
6.
Thomé, Emmanuel, et al.. (2015). Isogeny graphs with maximal real multiplication. HAL (Le Centre pour la Communication Scientifique Directe). 2 indexed citations
7.
Bai, Shi, Richard P. Brent, & Emmanuel Thomé. (2015). Root optimization of polynomials in the number field sieve. Mathematics of Computation. 84(295). 2447–2457. 6 indexed citations
8.
Thomé, Emmanuel. (2014). Algorithmes de calcul de logarithme discret dans les corps finis.
9.
Thomé, Emmanuel, et al.. (2014). Computation with No Memory, and Rearrangeable Multicast Networks. Discrete Mathematics & Theoretical Computer Science. Vol. 16 no. 1. 6 indexed citations
10.
Enge, Andreas & Emmanuel Thomé. (2014). Computing Class Polynomials for Abelian Surfaces. Experimental Mathematics. 23(2). 129–145. 10 indexed citations
11.
Cortier, Véronique, Jérémie Detrey, Pierrick Gaudry, et al.. (2011). Ballot stuffing in a postal voting system. HAL (Le Centre pour la Communication Scientifique Directe). 27–36. 3 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.
Kleinjung, Thorsten, Joppe W. Bos, Arjen K. Lenstra, et al.. (2010). A heterogeneous computing environment to solve the 768-bit RSA challenge. Cluster Computing. 15(1). 53–68. 8 indexed citations
14.
Kleinjung, Thorsten, Lucas Nussbaum, & Emmanuel Thomé. (2010). Using a grid platform for solving large sparse linear systems over GF(2). HAL (Le Centre pour la Communication Scientifique Directe). 2248. 161–168. 6 indexed citations
15.
Thomé, Emmanuel. (2009). Abstracts of the CADO workshop on integer factorization. ACM communications in computer algebra. 43(1/2). 11–14. 1 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.
Diem, Claus & Emmanuel Thomé. (2007). Index Calculus in Class Groups of Non-hyperelliptic Curves of Genus Three. Journal of Cryptology. 21(4). 593–611. 15 indexed citations
18.
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
19.
Thomé, Emmanuel. (2002). Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm. Journal of Symbolic Computation. 33(5). 757–775. 17 indexed citations
20.
Thomé, Emmanuel. (2001). Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm. HAL (Le Centre pour la Communication Scientifique Directe). 323–331. 7 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