Conferences

Enge, Andreas:
FastECPP over MPI.
In Buzzard, Kevin; Dickenstein, Alicia; Eick, Bettina; Leykin, Anton; Ren, Yue (editors):
Mathematical Software – ICMS 2024.
Lecture Notes in Computer Science vol. 14749.
Springer Nature Switzerland, 2024, pp. 36–45.

Enge, Andreas; Milan, Jérôme:
Implementing cryptographic pairings at standard security levels.
In Chakraborty, Rajat Subhra; Matyas, Vashek; Schaumont, Patrick (editors):
Security, Privacy, and Applied Cryptography Engineering — SPACE 2014.
Lecture Notes in Computer Science vol. 8804.
Springer International Publishing Switzerland, 2014, pp. 28–46.

Enge, Andreas; Sutherland, Andrew V.:
Class Invariants by the CRT Method.
In Hanrot, Guillaume; Morain, François; Thomé, Emmanuel (editors):
Algorithmic Number Theory — ANTS-IX.
Lecture Notes in Computer Science vol. 6197.
Springer-Verlag, 2010, pp. 142–156.

Belding, Juliana; Bröker, Reinier; Enge, Andreas; Lauter, Kristin:
Computing Hilbert class polynomials.
In van der Poorten, Alf; Stein, Andreas (editors):
Algorithmic Number Theory — ANTS-VIII.
Lecture Notes in Computer Science vol. 5011.
Springer-Verlag, 2008, pp. 282–295.

Enge, Andreas:
Discrete logarithms in curves over finite fields.
In Mullen, Gary L.; Panario, Daniel; Shparlinski, Igor E. (editors):
Finite Fields and Applications.
Contemporary Mathematics vol. 461.
American Mathematical Society, 2008, pp. 119–139.

Enge, Andreas; Gaudry, Pierrick:
An L(1/3 + ε) algorithm for the discrete logarithm problem for low degree curves.
In Naor, Moni (editor):
Advances in Cryptology — Eurocrypt 2007.
Lecture Notes in Computer Science vol. 4515.
Springer-Verlag, 2007, pp. 367–382.

Basiri, Abdolali; Enge, Andreas; Faugère, Jean-Charles; Gürel, Nicolas:
Implementing the Arithmetic of C3,4 Curves.
In Buell, Duncan (editor):
Algorithmic Number Theory — ANTS-VI.
Lecture Notes in Computer Science vol. 3076.
Springer-Verlag, 2004, pp. 87–101.

Enge, Andreas; Morain, François:
Fast Decomposition of Polynomials with Known Galois Group.
In Fossorier, Marc; Høholdt, Tom; Poli, Alain (editors):
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes — AAECC-15.
Lecture Notes in Computer Science vol. 2643.
Springer-Verlag, 2003, pp. 254–264.
Extended version.

Enge, Andreas; Morain, François:
Comparing Invariants for Class Fields of Imaginary Quadratic Fields.
In Fieker, Claus; Kohel, David R. (editors):
Algorithmic Number Theory — ANTS-V.
Lecture Notes in Computer Science vol. 2369.
Springer-Verlag, 2002, pp. 252–266.

Enge, Andreas:
How to Distinguish Hyperelliptic Curves in Even Characteristic.
In Alster, K.; Urbanowicz, J.; Williams, H. C. (editors):
Public-Key Cryptography and Computational Number Theory.
De Gruyter, 2001, pp. 49–58.

Enge, Andreas:
A General Framework for Subexponential Discrete Logarithm Algorithms in Groups of Unknown Order.
In Blokhuis, A.; Hirschfeld, J. W. P.; Jungnickel, D.; Thas, J. A. (editors):
Finite Geometries.
Developments in Mathematics vol. 3.
Kluwer Academic Publishers, 2001, pp. 133–146.

Büeler, Benno; Enge, Andreas; Fukuda, Komei:
Exact Volume Computation for Polytopes: A Practical Study.
In Kalai, Gil; Ziegler, Günter M. (editors):
Polytopes — Combinatorics and Computation.
DMV Seminar vol. 29.
Birkhäuser Verlag, 2000, pp. 131–154.