Claus Diem

643 total citations
14 papers, 167 citations indexed

About

Claus Diem is a scholar working on Information Systems, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, Claus Diem has authored 14 papers receiving a total of 167 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Information Systems, 9 papers in Artificial Intelligence and 8 papers in Geometry and Topology. Recurrent topics in Claus Diem's work include Coding theory and cryptography (9 papers), Cryptography and Residue Arithmetic (9 papers) and Algebraic Geometry and Number Theory (8 papers). Claus Diem is often cited by papers focused on Coding theory and cryptography (9 papers), Cryptography and Residue Arithmetic (9 papers) and Algebraic Geometry and Number Theory (8 papers). Claus Diem collaborates with scholars based in Germany, France and Canada. Claus Diem's co-authors include Emmanuel Thomé, Nicolas Thériault, Pierrick Gaudry, Irene I. Bouw and Gerhard Frey and has published in prestigious journals such as Mathematics of Computation, Journal of Algebra and Israel Journal of Mathematics.

In The Last Decade

Claus Diem

13 papers receiving 150 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Claus Diem Germany 6 102 98 54 41 35 14 167
Reynald Lercier France 8 95 0.9× 97 1.0× 71 1.3× 41 1.0× 5 0.1× 24 162
Renate Scheidler Canada 7 132 1.3× 82 0.8× 82 1.5× 48 1.2× 6 0.2× 37 176
Takakazu Satoh Japan 7 90 0.9× 82 0.8× 95 1.8× 17 0.4× 9 0.3× 19 194
Dustin Moody United States 6 69 0.7× 73 0.7× 47 0.9× 24 0.6× 6 0.2× 33 132
Andrew V. Sutherland United States 11 88 0.9× 92 0.9× 190 3.5× 43 1.0× 7 0.2× 28 252
David Kohel Australia 8 102 1.0× 44 0.4× 78 1.4× 44 1.1× 4 0.1× 17 164
Jonathan Sorenson United States 9 146 1.4× 93 0.9× 42 0.8× 80 2.0× 3 0.1× 25 222
R. J. Stroeker Netherlands 9 28 0.3× 69 0.7× 147 2.7× 67 1.6× 15 0.4× 23 220
Everett W. Howe United States 10 149 1.5× 83 0.8× 243 4.5× 64 1.6× 11 0.3× 32 285
Alina Ostafe Australia 8 127 1.2× 31 0.3× 69 1.3× 42 1.0× 6 0.2× 41 199

Countries citing papers authored by Claus Diem

Since Specialization
Citations

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

Fields of papers citing papers by Claus Diem

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Claus Diem

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

All Works

14 of 14 papers shown
1.
Diem, Claus. (2014). Bounded regularity. Journal of Algebra. 423. 1143–1160. 3 indexed citations
2.
Diem, Claus. (2013). On the Notion of Bit Complexity. Bulletin of the European Association for Theoretical Computer Science. 1(103). 35–52.
3.
Diem, Claus. (2013). On the discrete logarithm problem in elliptic curves II. Algebra & Number Theory. 7(6). 1281–1323. 4 indexed citations
4.
Diem, Claus. (2012). On the discrete logarithm problem for plane curves. Journal de Théorie des Nombres de Bordeaux. 24(3). 639–667. 3 indexed citations
5.
Diem, Claus. (2012). On the use of expansion series for stream ciphers. LMS Journal of Computation and Mathematics. 15. 326–340. 10 indexed citations
6.
Diem, Claus. (2010). On the discrete logarithm problem in class groups of curves. Mathematics of Computation. 80(273). 443–475. 13 indexed citations
7.
Diem, Claus. (2010). On the discrete logarithm problem in elliptic curves. Compositio Mathematica. 147(1). 75–104. 25 indexed citations
8.
Diem, Claus & Gerhard Frey. (2008). Non-constant curves of genus 2 with infinite pro-Galois covers. Israel Journal of Mathematics. 164(1). 193–220. 1 indexed citations
9.
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
10.
Diem, Claus. (2006). A survey on uncertainty principles related to quadratic forms.. Collectanea mathematica. 57(1). 1–36. 39 indexed citations
11.
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
12.
Diem, Claus, et al.. (2006). Ordinary elliptic curves of high rank over F¯p(x) with constant j-invariant II. Journal of Number Theory. 124(1). 31–41. 3 indexed citations
13.
Bouw, Irene I., et al.. (2004). Ordinary elliptic curves of high rank over with constant j-invariant. manuscripta mathematica. 114(4). 5 indexed citations
14.
Diem, Claus & Gerhard Frey. (2003). Non-constant genus 2 curves with pro-Galois covers. arXiv (Cornell University). 1 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