Journals
- Andreas Enge, William Hart and Fredrik Johansson:
Short addition sequences for theta functions.
Journal of Integer Sequences 18 (2), 2018, pp. 1–34. - Andreas Enge:
Bilinear pairings on elliptic curves.
L'Enseignement Mathématique 61 (2), 2015, pp. 211–243. - Andreas Enge and François Morain:
Generalised Weber Functions.
Acta Arithmetica 164 (4), 2014, pp. 309–341. - Andreas Enge and Emmanuel Thomé:
Computing class polynomials for abelian surfaces.
Experimental Mathematics 23 (2), 2014, pp. 129–145. - Andreas Enge and Reinhard Schertz:
Singular values of multiple eta-quotients for ramified primes.
LMS Journal of Computation and Mathematics 16, 2013, pp. 407–418. - Andreas Enge, Pierrick Gaudry and Emmanuel Thomé:
An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves.
Journal of Cryptology 24 (1), 2011, pp. 24–41. - Andreas Enge:
Computing modular polynomials in quasi-linear time.
Mathematics of Computation 78 (267), 2009, pp. 1809–1824. - Andreas Enge:
The complexity of class polynomial computation via floating point approximations.
Mathematics of Computation 78 (266), 2009, pp. 1089–1107. - Régis Dupont and Andreas Enge:
Provably Secure Non-Interactive Key Distribution Based on Pairings.
Discrete Applied Mathematics 154 (2), 2006, pp. 270–276.
Preliminary version in Daniel Augot, Pascale Charpin and Grigory Kabatianski, editors, Proceedings of the International Workshop on Coding and Cryptography, Versailles — WCC 2003, École Supérieure et d'Application des Transmissions, pages 165–174. - Andreas Enge and Reinhard Schertz:
Modular Curves of Composite Level.
Acta Arithmetica 118 (2), 2005, pp. 129–141. - Régis Dupont, Andreas Enge and François Morain:
Building curves with arbitrary small MOV degree over finite prime fields.
Journal of Cryptology 18 (2), 2005, pp. 79–89. - Abdolali Basiri, Andreas Enge, Jean-Charles Faugère and Nicolas Gürel:
The arithmetic of Jacobian groups of superelliptic cubics.
Mathematics of Computation 74 (249), 2005, pp. 389–410. - Andreas Enge and Reinhard Schertz:
Constructing elliptic curves over finite fields using double eta-quotients.
Journal de Théorie des Nombres de Bordeaux 16, 2004, pp. 555–568. - Andreas Enge and Andreas Stein:
Smooth Ideals in Hyperelliptic Function Fields.
Mathematics of Computation 71 (239), 2002, pp. 1219–1230. - Andreas Enge:
Computing Discrete Logarithms in High-Genus Hyperelliptic Jacobians in Provably Subexponential Time.
Mathematics of Computation 71 (238), 2002, pp. 729–742. - Andreas Enge and Pierrick Gaudry:
A General Framework for Subexponential Discrete Logarithm Algorithms.
Acta Arithmetica 102 (1), 2002, pp. 83–103. - Andreas Enge:
The Extended Euclidian Algorithm on Polynomials, and the Computational Efficiency of Hyperelliptic Cryptosystems.
Designs, Codes and Cryptography 23 (1), 2001, pp. 53–74. - Andreas Enge and Petra Huhn:
A Counterexample to H. Arsham: ``Initialization of the Simplex Algorithm: An Artificial-Free Approach''.
SIAM Review Online 40 (4), 1998.
