Andreas Enge

Available identifiers

zbMath Open enge.andreasMaRDI QIDQ194643

List of research outcomes

Publication	Date of Publication	Type
FastECPP over MPI	2024-11-13	Paper
Schertz style class invariants for quartic CM fields	2016-10-14	Paper
Elliptic curves and their applications to cryptography. An introduction	2016-05-02	Paper
Bilinear pairings on elliptic curves	2016-02-25	Paper
Generalised Weber functions	2014-08-14	Paper
Computing Class Polynomials for Abelian Surfaces	2014-08-08	Paper
Singular values of multiple eta-quotients for ramified primes	2014-07-11	Paper
An \(L(1/3)\) discrete logarithm algorithm for low degree curves	2011-04-01	Paper
Computing modular polynomials in quasi-linear time	2010-11-07	Paper
The complexity of class polynomial computation via floating point approximations	2010-11-07	Paper
Class Invariants by the CRT Method	2010-09-29	Paper
https://portal.mardi4nfdi.de/entity/Q3635542	2009-07-06	Paper
Computing Hilbert Class Polynomials	2008-05-27	Paper
An L (1/3 + ε) Algorithm for the Discrete Logarithm Problem for Low Degree Curves	2007-11-29	Paper
Provably secure non-interactive key distribution based on pairings	2006-04-28	Paper
Building curves with arbitrary small MOV degree over finite prime fields	2006-02-08	Paper
Modular curves of composite level	2005-09-07	Paper
Algorithmic Number Theory	2005-08-12	Paper
Constructing elliptic curves over finite fields using double eta-quotients	2005-07-26	Paper
The arithmetic of Jacobian groups of superelliptic cubics	2004-10-07	Paper
https://portal.mardi4nfdi.de/entity/Q4737490	2004-08-11	Paper
Fast Decomposition of Polynomials with Known Galois Group	2003-09-16	Paper
https://portal.mardi4nfdi.de/entity/Q4790459	2003-01-28	Paper
https://portal.mardi4nfdi.de/entity/Q4550667	2002-09-03	Paper
How to distinguish hyperelliptic curves in even characteristic.	2002-07-04	Paper
Smooth ideals in hyperelliptic function fields	2002-05-06	Paper
A general framework for subexponential discrete logarithm algorithms	2002-03-20	Paper
Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time	2002-03-19	Paper
The extended Euclidean algorithm on polynomials, and the computational efficiency of hyperelliptic cryptosystems	2001-11-04	Paper
https://portal.mardi4nfdi.de/entity/Q4518985	2000-12-03	Paper
FastECPP over MPI	N/A	Paper

Research outcomes over time

This page was built for person: Andreas Enge