Conferences
- Andreas Enge and Jérôme Milan:
Implementing cryptographic pairings at standard security levels.
In Rajat Subhra Chakraborty, Vashek Matyas and Patrick Schaumont (editors):
Security, Privacy, and Applied Cryptography Engineering — SPACE 2014
Lecture Notes in Computer Science vol. 8804.
Springer International Publishing Switzerland, Cham 2014, pp. 28–46. - Andreas Enge and Andrew V. Sutherland:
Class Invariants by the CRT Method.
In Guillaume Hanrot, François Morain and Emmanuel Thomé (editors):
Algorithmic Number Theory — ANTS-IX
Lecture Notes in Computer Science vol. 6197.
Springer-Verlag, Berlin 2010, pp. 142–156. - Juliana Belding, Reinier Bröker, Andreas Enge and Kristin Lauter:
Computing Hilbert class polynomials.
In Alf van der Poorten and Andreas Stein (editors):
Algorithmic Number Theory — ANTS-VIII
Lecture Notes in Computer Science vol. 5011.
Springer-Verlag, Berlin 2008, pp. 282–295. - Andreas Enge:
Discrete logarithms in curves over finite fields.
In Gary L. Mullen, Daniel Panario and Igor E. Shparlinski (editors):
Finite Fields and Applications
Contemporary Mathematics vol. 461.
American Mathematical Society 2008, pp. 119–139. - Andreas Enge and Pierrick Gaudry:
An L(1/3 + ε) algorithm for the discrete logarithm problem for low degree curves.
In Moni Naor (editors):
Advances in Cryptology — Eurocrypt 2007
Lecture Notes in Computer Science vol. 4515.
Springer-Verlag, Berlin 2007, pp. 367–382. - Abdolali Basiri, Andreas Enge, Jean-Charles Faugère and Nicolas Gürel:
Implementing the Arithmetic of C3,4 Curves.
In Duncan Buell (editors):
Algorithmic Number Theory — ANTS-VI
Lecture Notes in Computer Science vol. 3076.
Springer-Verlag, Berlin 2004, pp. 87–101. - Andreas Enge and François Morain:
Fast Decomposition of Polynomials with Known Galois Group.
In Marc Fossorier, Tom Høholdt and Alain Poli (editors):
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes — AAECC-15
Lecture Notes in Computer Science vol. 2643.
Springer-Verlag, Berlin 2003, pp. 254–264.
Extended version. - Andreas Enge and François Morain:
Comparing Invariants for Class Fields of Imaginary Quadratic Fields.
In Claus Fieker and David R. Kohel (editors):
Algorithmic Number Theory — ANTS-V
Lecture Notes in Computer Science vol. 2369.
Springer-Verlag, Berlin 2002, pp. 252–266. - Andreas Enge:
How to Distinguish Hyperelliptic Curves in Even Characteristic.
In K. Alster, J. Urbanowicz and H. C. Williams (editors):
Public-Key Cryptography and Computational Number Theory
De Gruyter, Berlin 2001, pp. 49–58. - Andreas Enge:
A General Framework for Subexponential Discrete Logarithm Algorithms in Groups of Unknown Order.
In A. Blokhuis, J. W. P. Hirschfeld, D. Jungnickel and J. A. Thas (editors):
Finite Geometries
Developments in Mathematics vol. 3.
Kluwer Academic Publishers, Dordrecht 2001, pp. 133–146. - Benno Büeler, Andreas Enge and Komei Fukuda:
Exact Volume Computation for Polytopes: A Practical Study.
In Gil Kalai and Günter M. Ziegler (editors):
Polytopes — Combinatorics and Computation
DMV Seminar vol. 29.
Birkhäuser Verlag, Basel 2000, pp. 131–154.
