Andreas Enge

	2011
26		Andreas Enge, Pierrick Gaudry, Emmanuel Thomé: An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves. J. Cryptology 24(1): 24-41 (2011)
	2010
25		Andreas Enge, Andrew V. Sutherland: Class Invariants by the CRT Method. ANTS 2010: 142-156
24		Andreas Enge, Andrew V. Sutherland: Class Invariants by the CRT Method. IACR Cryptology ePrint Archive 2010: 31 (2010)
	2009
23		Andreas Enge: Volume Computation for Polytopes: Strategies and Performances. Encyclopedia of Optimization 2009: 4032-4038
22		Andreas Enge, Pierrick Gaudry, Emmanuel Thomé: An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves CoRR abs/0905.2177: (2009)
21		Andreas Enge: The complexity of class polynomial computation via floating point approximations. Math. Comput. 78(266): 1089-1107 (2009)
20		Andreas Enge: Computing modular polynomials in quasi-linear time. Math. Comput. 78(267): 1809-1824 (2009)
	2008
19		Juliana Belding, Reinier Bröker, Andreas Enge, Kristin Lauter: Computing Hilbert Class Polynomials. ANTS 2008: 282-295
18		Juliana Belding, Reinier Bröker, Andreas Enge, Kristin Lauter: Computing Hilbert Class Polynomials. IACR Cryptology ePrint Archive 2008: 62 (2008)
	2007
17		Andreas Enge, Pierrick Gaudry: An L (1/3 + epsilon ) Algorithm for the Discrete Logarithm Problem for Low Degree Curves. EUROCRYPT 2007: 379-393
16		Andreas Enge: Computing modular polynomials in quasi-linear time CoRR abs/0704.3177: (2007)
15		Andreas Enge: Discrete logarithms in curves over finite fields CoRR abs/0712.3916: (2007)
14		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
13		Andreas Enge: The complexity of class polynomial computation via floating point approximations CoRR abs/cs/0601104: (2006)
12		Régis Dupont, Andreas Enge: Provably secure non-interactive key distribution based on pairings. Discrete Applied Mathematics 154(2): 270-276 (2006)
	2005
11		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)
10		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)
	2004
9		Abdolali Basiri, Andreas Enge, Jean-Charles Faugère, Nicolas Gürel: Implementing the Arithmetic of C3, 4Curves. ANTS 2004: 87-101
	2003
8		Andreas Enge, François Morain: Fast Decomposition of Polynomials with Known Galois Group. AAECC 2003: 254-264
	2002
7		Andreas Enge, François Morain: Comparing Invariants for Class Fields of Imaginary Quadratic Fields. ANTS 2002: 252-266
6		Régis Dupont, Andreas Enge: Practical Non-Interactive Key Distribution Based on Pairings. IACR Cryptology ePrint Archive 2002: 136 (2002)
5		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)
4		Andreas Enge: Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time. Math. Comput. 71(238): 729-742 (2002)
3		Andreas Enge, Andreas Stein: Smooth ideals in hyperelliptic function fields. Math. Comput. 71(239): 1219-1230 (2002)
	2001
2		Andreas Enge: The Extended Euclidian Algorithm on Polynomials, and the Computational Efficiency of Hyperelliptic Cryptosystems. Des. Codes Cryptography 23(1): 53-74 (2001)
	1999
1		Andreas Enge: Elliptic Curves and Their Applications to Cryptography - an introduction. Kluwer 1999: I-XVI, 1-164

Coauthor Index

1	Abdolali Basiri	[9] [10]
2	Juliana Belding	[18] [19]
3	Reinier Bröker	[18] [19]
4	Régis Dupont	[5] [6] [11] [12]
5	Jean-Charles Faugère	[9] [10]
6	Pierrick Gaudry	[14] [17] [22] [26]
7	Nicolas Gürel	[9] [10]
8	Kristin Lauter (Kristin E. Lauter)	[18] [19]
9	François Morain	[5] [7] [8] [11]
10	Andreas Stein	[3]
11	Andrew V. Sutherland	[24] [25]
12	Emmanuel Thomé	[22] [26]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page