Thorsten Kleinjung

1.4k total citations
18 papers, 116 citations indexed

About

Thorsten Kleinjung is a scholar working on Artificial Intelligence, Information Systems and Computational Theory and Mathematics. According to data from OpenAlex, Thorsten Kleinjung has authored 18 papers receiving a total of 116 indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Artificial Intelligence, 11 papers in Information Systems and 4 papers in Computational Theory and Mathematics. Recurrent topics in Thorsten Kleinjung's work include Coding theory and cryptography (12 papers), Cryptography and Residue Arithmetic (11 papers) and Cryptography and Data Security (5 papers). Thorsten Kleinjung is often cited by papers focused on Coding theory and cryptography (12 papers), Cryptography and Residue Arithmetic (11 papers) and Cryptography and Data Security (5 papers). Thorsten Kleinjung collaborates with scholars based in Switzerland, Germany and France. Thorsten Kleinjung's co-authors include Robert Granger, Jens Zumbrägel, Arjen K. Lenstra, Joppe W. Bos, Peter L. Montgomery, Jens Frankē, Emmanuel Thomé, Jan Pelzl, Lucas Nussbaum and Viktor Fischer and has published in prestigious journals such as Mathematics of Computation, Transactions of the American Mathematical Society and Mathematische Nachrichten.

In The Last Decade

Thorsten Kleinjung

18 papers receiving 100 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Thorsten Kleinjung Switzerland 7 93 76 23 19 13 18 116
Khoa Nguyen Singapore 7 91 1.0× 41 0.5× 26 1.1× 21 1.1× 22 1.7× 22 113
Razvan Barbulescu France 3 89 1.0× 71 0.9× 21 0.9× 13 0.7× 7 0.5× 10 107
Daniel R. L. Brown Canada 5 55 0.6× 41 0.5× 19 0.8× 13 0.7× 16 1.2× 11 85
Sylvain Duquesne France 7 127 1.4× 114 1.5× 22 1.0× 16 0.8× 10 0.8× 18 166
Robert Zuccherato Canada 7 109 1.2× 95 1.3× 17 0.7× 13 0.7× 29 2.2× 11 130
Luca De Feo France 4 120 1.3× 97 1.3× 12 0.5× 17 0.9× 32 2.5× 11 152
Jérôme Plût France 1 104 1.1× 86 1.1× 11 0.5× 12 0.6× 31 2.4× 2 130
Masaaki Shirase Japan 7 140 1.5× 79 1.0× 38 1.7× 21 1.1× 14 1.1× 26 148
Jaecheol Ha South Korea 6 98 1.1× 58 0.8× 20 0.9× 5 0.3× 32 2.5× 48 115
Christophe Petit Belgium 6 97 1.0× 35 0.5× 5 0.2× 14 0.7× 29 2.2× 23 122

Countries citing papers authored by Thorsten Kleinjung

Since Specialization
Citations

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

Fields of papers citing papers by Thorsten Kleinjung

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Thorsten Kleinjung

This figure shows the co-authorship network connecting the top 25 collaborators of Thorsten Kleinjung. A scholar is included among the top collaborators of Thorsten Kleinjung 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 Thorsten Kleinjung. Thorsten Kleinjung is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

18 of 18 papers shown
1.
Kleinjung, Thorsten, et al.. (2020). Cryptanalysis of the generalised Legendre pseudorandom function. 4(1). 267–282. 1 indexed citations
2.
Granger, Robert, Thorsten Kleinjung, & Jens Zumbrägel. (2018). Indiscreet logarithms in finite fields of small characteristic. Advances in Mathematics of Communications. 12(2). 263–286. 3 indexed citations
3.
Frankē, Jens, et al.. (2017). A practical analytic method for calculating $\pi (x)$. Mathematics of Computation. 86(308). 2889–2909. 2 indexed citations
4.
Granger, Robert, Thorsten Kleinjung, & Jens Zumbrägel. (2016). On the discrete logarithm problem in finite fields of fixed characteristic. Transactions of the American Mathematical Society. 370(5). 3129–3145. 14 indexed citations
5.
Kleinjung, Thorsten. (2015). Quadratic sieving. Mathematics of Computation. 85(300). 1861–1873. 3 indexed citations
6.
Granger, Robert, Thorsten Kleinjung, & Jens Zumbrägel. (2014). Breaking `128-bit Secure" Supersingular Binary Curves (or how to solve discrete logarithms in ${\mathbb F}_{2^{4 \cdot 1223}}$ and ${\mathbb F}_{2^{12 \cdot 367}}$). Infoscience (Ecole Polytechnique Fédérale de Lausanne). 126–145. 1 indexed citations
7.
Granger, Robert, Thorsten Kleinjung, & Jens Zumbrägel. (2014). Breaking '128-bit Secure' Supersingular Binary Curves - (Or How to Solve Discrete Logarithms in F 2 4 1223 and F 2 12 367 ).. 126–145. 6 indexed citations
8.
Frankē, Jens, et al.. (2013). Some applications of the Weil‐Barner explicit formula. Mathematische Nachrichten. 286(5-6). 536–549. 2 indexed citations
9.
Barbulescu, Razvan, et al.. (2013). Finding ECM-friendly curves through a study of Galois properties. 1(1). 63–86. 1 indexed citations
10.
Ding, Jíntai & Thorsten Kleinjung. (2012). Degree of regularity for HFE Minus (HFE. Kyushu University Institutional Repository (QIR) (Kyushu University). 4. 97–104. 1 indexed citations
11.
Bos, Joppe W., et al.. (2012). Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 2(3). 212–212. 21 indexed citations
12.
Bos, Joppe W., Thorsten Kleinjung, Arjen K. Lenstra, & Peter L. Montgomery. (2011). Efficient SIMD Arithmetic Modulo a Mersenne Number. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 5677. 213–221. 8 indexed citations
13.
Kassem, Mohamed A., Jíntai Ding, Thorsten Kleinjung, Stanislav Bulygin, & Johannes Buchmann. (2010). PWXL: A Parallel Wiedemann-XL Algorithm for Solving Polynomial Equations over GF(2). 2 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.
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
16.
Kleinjung, Thorsten. (2006). On polynomial selection for the general number field sieve. Mathematics of Computation. 75(256). 2037–2047. 17 indexed citations
17.
Pelzl, Jan, et al.. (2005). Hardware Factorization Based on Elliptic Curve Method. HAL (Le Centre pour la Communication Scientifique Directe). 107–116. 10 indexed citations
18.
Pelzl, Jan, Thorsten Kleinjung, Jens Frankē, et al.. (2005). Area–time efficient hardware architecture for factoring integers with the elliptic curve method. HAL (Le Centre pour la Communication Scientifique Directe). 152(1). 67–67. 10 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