Andreas Enge

36 papers A* 1Journal 24Unranked 7
YearRankTypeTitle / Venue / Authors
2024 — conf
FastECPP over MPI.
ICMS
Andreas Enge
2018 J jnl
Short Addition Sequences for Theta Functions.
J. Integer Seq.
Andreas Enge, William Hart, Fredrik Johansson
2014 J jnl
Computing Class Polynomials for Abelian Surfaces.
Exp. Math.
Andreas Enge, Emmanuel Thomé
2014 — conf
Implementing Cryptographic Pairings at Standard Security Levels.
SPACE
Andreas Enge, Jérôme Milan
2014 J jnl
Implementing cryptographic pairings at standard security levels.
CoRR
Andreas Enge, Jérôme Milan
2013 J jnl
Computing class polynomials for abelian surfaces
CoRR
Andreas Enge, Emmanuel Thomé
2013 J jnl
Computing class polynomials for abelian surfaces.
IACR Cryptol. ePrint Arch.
Andreas Enge, Emmanuel Thomé
2013 — ch.
Elliptic curve cryptographic systems.
Handbook of Finite Fields
Andreas Enge
2013 J jnl
Singular values of multiple eta-quotients for ramified primes.
LMS J. Comput. Math.
Andreas Enge, Reinhard Schertz
2011 J jnl
An
J. Cryptol.
Andreas Enge, Pierrick Gaudry, Emmanuel Thomé
2010 — conf
Class Invariants by the CRT Method.
ANTS
Andreas Enge, Andrew V. Sutherland
2010 J jnl
Class Invariants by the CRT Method.
IACR Cryptol. ePrint Arch.
Andreas Enge, Andrew V. Sutherland
2009 J jnl
An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves
CoRR
Andreas Enge, Pierrick Gaudry, Emmanuel Thomé
2009 J jnl
Computing modular polynomials in quasi-linear time.
Math. Comput.
Andreas Enge
2009 J jnl
The complexity of class polynomial computation via floating point approximations.
Math. Comput.
Andreas Enge
2009 — ch.
Volume Computation for Polytopes: Strategies and Performances.
Encyclopedia of Optimization
Andreas Enge
2008 — conf
Computing Hilbert Class Polynomials.
ANTS
Juliana Belding, Reinier Bröker, Andreas Enge, Kristin E. Lauter
2008 J jnl
Computing Hilbert Class Polynomials.
IACR Cryptol. ePrint Arch.
Juliana Belding, Reinier Bröker, Andreas Enge, Kristin E. Lauter
2007 A* conf
An
EUROCRYPT
Andreas Enge, Pierrick Gaudry
2007 J jnl
An L(1/3 + epsilon) Algorithm for the Discrete Logarithm Problem for Low Degree Curves
CoRR
Andreas Enge, Pierrick Gaudry
2007 J jnl
Computing modular polynomials in quasi-linear time
CoRR
Andreas Enge
2007 J jnl
Discrete logarithms in curves over finite fields
CoRR
Andreas Enge
2006 J jnl
Provably secure non-interactive key distribution based on pairings.
Discret. Appl. Math.
Régis Dupont, Andreas Enge
2006 J jnl
The complexity of class polynomial computation via floating point approximations
CoRR
Andreas Enge
2005 J jnl
Building Curves with Arbitrary Small MOV Degree over Finite Prime Fields.
J. Cryptol.
Régis Dupont, Andreas Enge, François Morain
2005 J jnl
The arithmetic of Jacobian groups of superelliptic cubics.
Math. Comput.
Abdolali Basiri, Andreas Enge, Jean-Charles Faugère, Nicolas Gürel
2004 — conf
Implementing the Arithmetic of C
ANTS
Abdolali Basiri, Andreas Enge, Jean-Charles Faugère, Nicolas Gürel
2003 — conf
Fast Decomposition of Polynomials with Known Galois Group.
AAECC
Andreas Enge, François Morain
2002 J jnl
Building curves with arbitrary small MOV degree over finite prime fields.
IACR Cryptol. ePrint Arch.
Régis Dupont, Andreas Enge, François Morain
2002 — conf
Comparing Invariants for Class Fields of Imaginary Quadratic Fields.
ANTS
Andreas Enge, François Morain
2002 J jnl
Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time.
Math. Comput.
Andreas Enge
2002 J jnl
Practical Non-Interactive Key Distribution Based on Pairings.
IACR Cryptol. ePrint Arch.
Régis Dupont, Andreas Enge
2002 J jnl
Smooth ideals in hyperelliptic function fields.
Math. Comput.
Andreas Enge, Andreas Stein
2001 J jnl
The Extended Euclidian Algorithm on Polynomials, and the Computational Efficiency of Hyperelliptic Cryptosystems.
Des. Codes Cryptogr.
Andreas Enge
2000 — —
Hyperelliptic cryptosystems: efficiency and subexponential attacks.
Andreas Enge
1999 — book
Elliptic Curves and Their Applications to Cryptography - an introduction.
Andreas Enge