Andreas Enge

From MaRDI portal
Person:194643

Available identifiers

zbMath Open enge.andreasMaRDI QIDQ194643

List of research outcomes

PublicationDate of PublicationType
Schertz style class invariants for quartic CM fields2016-10-14Paper
Elliptic Curves and Their Applications to Cryptography2016-05-02Paper
Bilinear pairings on elliptic curves2016-02-25Paper
Generalised Weber functions2014-08-14Paper
Computing Class Polynomials for Abelian Surfaces2014-08-08Paper
Singular values of multiple eta-quotients for ramified primes2014-07-11Paper
An \(L(1/3)\) discrete logarithm algorithm for low degree curves2011-04-01Paper
The complexity of class polynomial computation via floating point approximations2010-11-07Paper
Computing modular polynomials in quasi-linear time2010-11-07Paper
Class Invariants by the CRT Method2010-09-29Paper
https://portal.mardi4nfdi.de/entity/Q36355422009-07-06Paper
Computing Hilbert Class Polynomials2008-05-27Paper
An L (1/3 + ε) Algorithm for the Discrete Logarithm Problem for Low Degree Curves2007-11-29Paper
Provably secure non-interactive key distribution based on pairings2006-04-28Paper
Building curves with arbitrary small MOV degree over finite prime fields2006-02-08Paper
Modular curves of composite level2005-09-07Paper
Algorithmic Number Theory2005-08-12Paper
Constructing elliptic curves over finite fields using double eta-quotients2005-07-26Paper
The arithmetic of Jacobian groups of superelliptic cubics2004-10-07Paper
https://portal.mardi4nfdi.de/entity/Q47374902004-08-11Paper
Fast Decomposition of Polynomials with Known Galois Group2003-09-16Paper
https://portal.mardi4nfdi.de/entity/Q47904592003-01-28Paper
https://portal.mardi4nfdi.de/entity/Q45506672002-09-03Paper
https://portal.mardi4nfdi.de/entity/Q27642322002-07-04Paper
Smooth ideals in hyperelliptic function fields2002-05-06Paper
A general framework for subexponential discrete logarithm algorithms2002-03-20Paper
Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time2002-03-19Paper
The extended Euclidean algorithm on polynomials, and the computational efficiency of hyperelliptic cryptosystems2001-11-04Paper
https://portal.mardi4nfdi.de/entity/Q45189852000-12-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Andreas Enge