Andreas Enge

Publication Activity (10 Years)

Years Active: 2001-2018
Publications (10 Years): 1

Top Venues

CoRR

SPACE

IACR Cryptol. ePrint Arch.

Exp. Math.

University of Augsburg, Germany (PHD)

Education History

University of Augsburg, Germany

PHD

Publications

Andreas Enge, William Hart, Fredrik Johansson
Short Addition Sequences for Theta Functions. J. Integer Seq. 21 (2) (2018)
Andreas Enge, Jérôme Milan
Implementing Cryptographic Pairings at Standard Security Levels. SPACE (2014)
Andreas Enge, Jérôme Milan
Implementing cryptographic pairings at standard security levels. CoRR (2014)
Andreas Enge, Emmanuel Thomé
Computing Class Polynomials for Abelian Surfaces. Exp. Math. 23 (2) (2014)
Andreas Enge, Emmanuel Thomé
Computing class polynomials for abelian surfaces. IACR Cryptol. ePrint Arch. 2013 (2013)
Andreas Enge, Emmanuel Thomé
Computing class polynomials for abelian surfaces CoRR (2013)
Andreas Enge, Pierrick Gaudry, Emmanuel Thomé
(1/3) Discrete Logarithm Algorithm for Low Degree Curves. J. Cryptol. 24 (1) (2011)
Andreas Enge, Andrew V. Sutherland
Class Invariants by the CRT Method. ANTS (2010)
Andreas Enge, Andrew V. Sutherland
Class Invariants by the CRT Method. IACR Cryptol. ePrint Arch. 2010 (2010)
Andreas Enge, Pierrick Gaudry, Emmanuel Thomé
An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves CoRR (2009)
Andreas Enge
Computing modular polynomials in quasi-linear time. Math. Comput. 78 (267) (2009)
Andreas Enge
The complexity of class polynomial computation via floating point approximations. Math. Comput. 78 (266) (2009)
Juliana Belding, Reinier Bröker, Andreas Enge, Kristin E. Lauter
Computing Hilbert Class Polynomials. IACR Cryptol. ePrint Arch. 2008 (2008)
Juliana Belding, Reinier Bröker, Andreas Enge, Kristin E. Lauter
Computing Hilbert Class Polynomials. ANTS (2008)
Andreas Enge, Pierrick Gaudry
An L(1/3 + epsilon) Algorithm for the Discrete Logarithm Problem for Low Degree Curves CoRR (2007)
Andreas Enge
Discrete logarithms in curves over finite fields CoRR (2007)
Andreas Enge, Pierrick Gaudry
) Algorithm for the Discrete Logarithm Problem for Low Degree Curves. EUROCRYPT (2007)
Andreas Enge
Computing modular polynomials in quasi-linear time CoRR (2007)
Régis Dupont, Andreas Enge
Provably secure non-interactive key distribution based on pairings. Discret. Appl. Math. 154 (2) (2006)
Andreas Enge
The complexity of class polynomial computation via floating point approximations CoRR (2006)
Abdolali Basiri, Andreas Enge, Jean-Charles Faugère, Nicolas Gürel
The arithmetic of Jacobian groups of superelliptic cubics. Math. Comput. 74 (249) (2005)
Régis Dupont, Andreas Enge, François Morain
Building Curves with Arbitrary Small MOV Degree over Finite Prime Fields. J. Cryptol. 18 (2) (2005)
Abdolali Basiri, Andreas Enge, Jean-Charles Faugère, Nicolas Gürel
Curves. ANTS (2004)
Andreas Enge, François Morain
Fast Decomposition of Polynomials with Known Galois Group. AAECC (2003)
Régis Dupont, Andreas Enge, François Morain
Building curves with arbitrary small MOV degree over finite prime fields. IACR Cryptol. ePrint Arch. 2002 (2002)
Andreas Enge, François Morain
Comparing Invariants for Class Fields of Imaginary Quadratic Fields. ANTS (2002)
Régis Dupont, Andreas Enge
Practical Non-Interactive Key Distribution Based on Pairings. IACR Cryptol. ePrint Arch. 2002 (2002)
Andreas Enge, Andreas Stein
Smooth ideals in hyperelliptic function fields. Math. Comput. 71 (239) (2002)
Andreas Enge
Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time. Math. Comput. 71 (238) (2002)
Andreas Enge
The Extended Euclidian Algorithm on Polynomials, and the Computational Efficiency of Hyperelliptic Cryptosystems. Des. Codes Cryptogr. 23 (1) (2001)

Andreas Enge.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Andreas Enge