| 2009 |
|---|
| 15 | EE | Andreas Enge:
Volume Computation for Polytopes: Strategies and Performances.
Encyclopedia of Optimization 2009: 4032-4038 |
| 2008 |
|---|
| 14 | EE | Juliana Belding,
Reinier Bröker,
Andreas Enge,
Kristin Lauter:
Computing Hilbert Class Polynomials.
ANTS 2008: 282-295 |
| 2007 |
|---|
| 13 | EE | Andreas Enge,
Pierrick Gaudry:
An L (1/3 + epsilon ) Algorithm for the Discrete Logarithm Problem for Low Degree Curves.
EUROCRYPT 2007: 379-393 |
| 12 | EE | Andreas Enge:
Computing modular polynomials in quasi-linear time
CoRR abs/0704.3177: (2007) |
| 11 | EE | Andreas Enge:
Discrete logarithms in curves over finite fields
CoRR abs/0712.3916: (2007) |
| 10 | EE | Andreas Enge,
Pierrick Gaudry:
An L(1/3 + epsilon) Algorithm for the Discrete Logarithm Problem for Low Degree Curves
CoRR abs/cs/0703032: (2007) |
| 2006 |
|---|
| 9 | EE | Andreas Enge:
The complexity of class polynomial computation via floating point approximations
CoRR abs/cs/0601104: (2006) |
| 8 | EE | Régis Dupont,
Andreas Enge:
Provably secure non-interactive key distribution based on pairings.
Discrete Applied Mathematics 154(2): 270-276 (2006) |
| 2005 |
|---|
| 7 | EE | 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) |
| 2004 |
|---|
| 6 | EE | Abdolali Basiri,
Andreas Enge,
Jean-Charles Faugère,
Nicolas Gürel:
Implementing the Arithmetic of C3, 4Curves.
ANTS 2004: 87-101 |
| 2003 |
|---|
| 5 | EE | Andreas Enge,
François Morain:
Fast Decomposition of Polynomials with Known Galois Group.
AAECC 2003: 254-264 |
| 2002 |
|---|
| 4 | EE | Andreas Enge,
François Morain:
Comparing Invariants for Class Fields of Imaginary Quadratic Fields.
ANTS 2002: 252-266 |
| 3 | | Andreas Enge:
Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time.
Math. Comput. 71(238): 729-742 (2002) |
| 2 | | Andreas Enge,
Andreas Stein:
Smooth ideals in hyperelliptic function fields.
Math. Comput. 71(239): 1219-1230 (2002) |
| 2001 |
|---|
| 1 | | Andreas Enge:
The Extended Euclidian Algorithm on Polynomials, and the Computational Efficiency of Hyperelliptic Cryptosystems.
Des. Codes Cryptography 23(1): 53-74 (2001) |
