Andreas Enge

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

Andreas Enge, Andrew V. Sutherland: Class Invariants by the CRT Method. ANTS 2010: 142-156

Andreas Enge, Andrew V. Sutherland: Class Invariants by the CRT Method. IACR Cryptology ePrint Archive 2010: 31 (2010)

Andreas Enge: The complexity of class polynomial computation via floating point approximations. Math. Comput. 78(266): 1089-1107 (2009)

Andreas Enge: Computing modular polynomials in quasi-linear time. Math. Comput. 78(267): 1809-1824 (2009)

Andreas Enge: Volume Computation for Polytopes: Strategies and Performances. Encyclopedia of Optimization 2009: 4032-4038

Andreas Enge, Pierrick Gaudry, Emmanuel Thomé: An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves. CoRR abs/0905.2177 (2009)

Juliana Belding, Reinier Bröker, Andreas Enge, Kristin Lauter: Computing Hilbert Class Polynomials. ANTS 2008: 282-295

Juliana Belding, Reinier Bröker, Andreas Enge, Kristin Lauter: Computing Hilbert Class Polynomials. IACR Cryptology ePrint Archive 2008: 62 (2008)

Andreas Enge, Pierrick Gaudry: An L (1/3 + epsilon ) Algorithm for the Discrete Logarithm Problem for Low Degree Curves. EUROCRYPT 2007: 379-393

Andreas Enge: Computing modular polynomials in quasi-linear time. CoRR abs/0704.3177 (2007)

Andreas Enge: Discrete logarithms in curves over finite fields. CoRR abs/0712.3916 (2007)

Andreas Enge, Pierrick Gaudry: An L(1/3 + epsilon) Algorithm for the Discrete Logarithm Problem for Low Degree Curves. CoRR abs/cs/0703032 (2007)

Régis Dupont, Andreas Enge: Provably secure non-interactive key distribution based on pairings. Discrete Applied Mathematics 154(2): 270-276 (2006)

Andreas Enge: The complexity of class polynomial computation via floating point approximations. CoRR abs/cs/0601104 (2006)

Régis Dupont, Andreas Enge, François Morain: Building Curves with Arbitrary Small MOV Degree over Finite Prime Fields. J. Cryptology 18(2): 79-89 (2005)

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

Abdolali Basiri, Andreas Enge, Jean-Charles Faugère, Nicolas Gürel: Implementing the Arithmetic of C_{3, 4}Curves. ANTS 2004: 87-101

Andreas Enge, François Morain: Fast Decomposition of Polynomials with Known Galois Group. AAECC 2003: 254-264

Andreas Enge: Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time. Math. Comput. 71(238): 729-742 (2002)

Andreas Enge, Andreas Stein: Smooth ideals in hyperelliptic function fields. Math. Comput. 71(239): 1219-1230 (2002)

Andreas Enge, François Morain: Comparing Invariants for Class Fields of Imaginary Quadratic Fields. ANTS 2002: 252-266

Régis Dupont, Andreas Enge, François Morain: Building curves with arbitrary small MOV degree over finite prime fields. IACR Cryptology ePrint Archive 2002: 94 (2002)

Régis Dupont, Andreas Enge: Practical Non-Interactive Key Distribution Based on Pairings. IACR Cryptology ePrint Archive 2002: 136 (2002)

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

Andreas Enge: Elliptic Curves and Their Applications to Cryptography - an introduction. Kluwer 1999, isbn 978-0-7923-8589-9, pp. I-XVI, 1-164