Journals

Enge, Andreas:
[Re] Volume computation for polytopes: Vingt ans après.
ReScience C 6 (1), 2020, pp. \#17.

Enge, Andreas; Hart, William; Johansson, Fredrik:
Short addition sequences for theta functions.
Journal of Integer Sequences 18 (2), 2018, pp. 1–34.

Enge, Andreas:
Bilinear pairings on elliptic curves.
L'Enseignement Mathématique 61 (2), 2015, pp. 211–243.

Enge, Andreas; Morain, François:
Generalised Weber Functions.
Acta Arithmetica 164 (4), 2014, pp. 309–341.

Enge, Andreas; Thomé, Emmanuel:
Computing class polynomials for abelian surfaces.
Experimental Mathematics 23 (2), 2014, pp. 129–145.

Enge, Andreas; Schertz, Reinhard:
Singular values of multiple eta-quotients for ramified primes.
LMS Journal of Computation and Mathematics 16, 2013, pp. 407–418.

Enge, Andreas; Gaudry, Pierrick; Thomé, Emmanuel:
An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves.
Journal of Cryptology 24 (1), 2011, pp. 24–41.

Enge, Andreas:
Computing modular polynomials in quasi-linear time.
Mathematics of Computation 78 (267), 2009, pp. 1809–1824.

Enge, Andreas:
The complexity of class polynomial computation via floating point approximations.
Mathematics of Computation 78 (266), 2009, pp. 1089–1107.

Dupont, Régis; Enge, Andreas:
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.

Enge, Andreas; Schertz, Reinhard:
Modular Curves of Composite Level.
Acta Arithmetica 118 (2), 2005, pp. 129–141.

Dupont, Régis; Enge, Andreas; Morain, François:
Building curves with arbitrary small MOV degree over finite prime fields.
Journal of Cryptology 18 (2), 2005, pp. 79–89.

Basiri, Abdolali; Enge, Andreas; Faugère, Jean-Charles; Gürel, Nicolas:
The arithmetic of Jacobian groups of superelliptic cubics.
Mathematics of Computation 74 (249), 2005, pp. 389–410.

Enge, Andreas; Schertz, Reinhard:
Constructing elliptic curves over finite fields using double eta-quotients.
Journal de Théorie des Nombres de Bordeaux 16 (3), 2004, pp. 555–568.

Enge, Andreas; Stein, Andreas:
Smooth Ideals in Hyperelliptic Function Fields.
Mathematics of Computation 71 (239), 2002, pp. 1219–1230.

Enge, Andreas:
Computing Discrete Logarithms in High-Genus Hyperelliptic Jacobians in Provably Subexponential Time.
Mathematics of Computation 71 (238), 2002, pp. 729–742.

Enge, Andreas; Gaudry, Pierrick:
A General Framework for Subexponential Discrete Logarithm Algorithms.
Acta Arithmetica 102 (1), 2002, pp. 83–103.

Enge, Andreas:
The Extended Euclidian Algorithm on Polynomials, and the Computational Efficiency of Hyperelliptic Cryptosystems.
Designs, Codes and Cryptography 23 (1), 2001, pp. 53–74.

Enge, Andreas; Huhn, Petra:
A Counterexample to H. Arsham: ``Initialization of the Simplex Algorithm: An Artificial-Free Approach''.
SIAM Review Online 40 (4), 1998.