Andreas Enge

1.2k total citations
20 papers, 281 citations indexed

About

Andreas Enge is a scholar working on Information Systems, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, Andreas Enge has authored 20 papers receiving a total of 281 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Information Systems, 13 papers in Artificial Intelligence and 10 papers in Geometry and Topology. Recurrent topics in Andreas Enge's work include Cryptography and Residue Arithmetic (14 papers), Coding theory and cryptography (11 papers) and Algebraic Geometry and Number Theory (10 papers). Andreas Enge is often cited by papers focused on Cryptography and Residue Arithmetic (14 papers), Coding theory and cryptography (11 papers) and Algebraic Geometry and Number Theory (10 papers). Andreas Enge collaborates with scholars based in France, Germany and United States. Andreas Enge's co-authors include Pierrick Gaudry, François Morain, Emmanuel Thomé, Andreas Stein, Jean‐Charles Faugère, Marc Girault and Christopher Wolf and has published in prestigious journals such as Mathematics of Computation, Discrete Applied Mathematics and Journal of Cryptology.

In The Last Decade

Andreas Enge

20 papers receiving 237 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Andreas Enge France 9 207 189 111 72 33 20 281
Victor S. Miller United States 4 249 1.2× 204 1.1× 67 0.6× 56 0.8× 27 0.8× 8 307
Edlyn Teske Canada 10 297 1.4× 261 1.4× 85 0.8× 87 1.2× 41 1.2× 14 367
François Morain France 10 305 1.5× 333 1.8× 173 1.6× 131 1.8× 44 1.3× 22 459
Emmanuel Thomé France 8 133 0.6× 122 0.6× 56 0.5× 58 0.8× 16 0.5× 20 194
Elizabeth Scott United Kingdom 11 247 1.2× 82 0.4× 48 0.4× 128 1.8× 7 0.2× 42 368
Hans-Georg Rück Germany 10 417 2.0× 314 1.7× 201 1.8× 58 0.8× 47 1.4× 15 530
Jonathan Sorenson United States 9 146 0.7× 93 0.5× 42 0.4× 80 1.1× 20 0.6× 25 222
Young-Ho Park South Korea 8 143 0.7× 119 0.6× 38 0.3× 14 0.2× 22 0.7× 45 224
Shuqin Fan China 11 280 1.4× 106 0.6× 40 0.4× 55 0.8× 22 0.7× 26 313
Maozhi Xu China 10 211 1.0× 117 0.6× 25 0.2× 39 0.5× 38 1.2× 53 291

Countries citing papers authored by Andreas Enge

Since Specialization
Citations

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

Fields of papers citing papers by Andreas Enge

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Andreas Enge

This figure shows the co-authorship network connecting the top 25 collaborators of Andreas Enge. A scholar is included among the top collaborators of Andreas Enge 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 Andreas Enge. Andreas Enge 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.
Enge, Andreas. (2016). Bilinear pairings on elliptic curves. 61(1). 211–243. 3 indexed citations
2.
Enge, Andreas & François Morain. (2014). Generalised Weber functions. Acta Arithmetica. 164(4). 309–341. 2 indexed citations
3.
Enge, Andreas & Emmanuel Thomé. (2014). Computing Class Polynomials for Abelian Surfaces. Experimental Mathematics. 23(2). 129–145. 10 indexed citations
4.
Enge, Andreas, et al.. (2013). A Counterexample to H. Arsham: “Initialization of the Simplex Algorithm: An Artificial-Free Approach”. OPUS (Augsburg University). 3 indexed citations
5.
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
6.
Enge, Andreas, et al.. (2009). Constructing elliptic curves over finite fields using double eta-quotients. Journal de Théorie des Nombres de Bordeaux. 16(3). 555–568. 7 indexed citations
7.
Enge, Andreas. (2009). Computing modular polynomials in quasi-linear time. Mathematics of Computation. 78(267). 1809–1824. 12 indexed citations
8.
Enge, Andreas. (2008). Discrete logarithms in curves over finite fields. Contemporary mathematics - American Mathematical Society. 461. 119–139. 2 indexed citations
9.
Enge, Andreas. (2008). The complexity of class polynomial computation via floating point approximations. Mathematics of Computation. 78(266). 1089–1107. 30 indexed citations
10.
Enge, Andreas, Marc Girault, & Christopher Wolf. (2007). Hardness of the Main Computational Problems Used in Cryptography. 3 indexed citations
11.
Enge, Andreas, et al.. (2005). Provably secure non-interactive key distribution based on pairings. Discrete Applied Mathematics. 154(2). 270–276. 28 indexed citations
12.
Enge, Andreas, et al.. (2005). Modular curves of composite level. Acta Arithmetica. 118(2). 129–141. 7 indexed citations
13.
Enge, Andreas, et al.. (2004). The arithmetic of Jacobian groups of superelliptic cubics. Mathematics of Computation. 74(249). 389–411. 5 indexed citations
14.
Enge, Andreas, et al.. (2004). Building Curves with Arbitrary Small MOV Degree over Finite PrimeFields. Journal of Cryptology. 18(2). 79–89. 24 indexed citations
15.
Enge, Andreas & Pierrick Gaudry. (2002). A general framework for subexponential discrete logarithm algorithms. Acta Arithmetica. 102(1). 83–103. 39 indexed citations
16.
Enge, Andreas. (2001). . Designs Codes and Cryptography. 23(1). 53–74. 5 indexed citations
17.
Enge, Andreas. (2001). Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time. Mathematics of Computation. 71(238). 729–743. 24 indexed citations
18.
Enge, Andreas & Andreas Stein. (2001). Smooth ideals in hyperelliptic function fields. Mathematics of Computation. 71(239). 1219–1230. 5 indexed citations
19.
Enge, Andreas. (1999). Elliptic Curves and Their Applications to Cryptography: An Introduction. CERN Document Server (European Organization for Nuclear Research). 39 indexed citations
20.
Enge, Andreas. (1999). Elliptic Curves and Their Applications to Cryptography. 29 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