default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Enge
Person information
- affiliation: INRIA Bordeaux-Sud-Ouest, France
- affiliation: École Polytechnique, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Andreas Enge:
FastECPP over MPI. ICMS 2024: 36-45
2010 – 2019
- 2018
- [j12]Andreas Enge, William Hart, Fredrik Johansson:
Short Addition Sequences for Theta Functions. J. Integer Seq. 21(2): 18.2.4 (2018) - 2014
- [j11]Andreas Enge, Emmanuel Thomé
:
Computing Class Polynomials for Abelian Surfaces. Exp. Math. 23(2): 129-145 (2014) - [c7]Andreas Enge, Jérôme Milan:
Implementing Cryptographic Pairings at Standard Security Levels. SPACE 2014: 28-46 - [i12]Andreas Enge, Jérôme Milan:
Implementing cryptographic pairings at standard security levels. CoRR abs/1407.5953 (2014) - 2013
- [j10]Andreas Enge, Reinhard Schertz:
Singular values of multiple eta-quotients for ramified primes. LMS J. Comput. Math. 16: 407-418 (2013) - [p1]Andreas Enge:
Elliptic curve cryptographic systems. Handbook of Finite Fields 2013: 784-796 - [i11]Andreas Enge, Emmanuel Thomé:
Computing class polynomials for abelian surfaces. CoRR abs/1305.4330 (2013) - [i10]Andreas Enge, Emmanuel Thomé:
Computing class polynomials for abelian surfaces. IACR Cryptol. ePrint Arch. 2013: 299 (2013) - 2011
- [j9]Andreas Enge, Pierrick Gaudry, Emmanuel Thomé:
An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves. J. Cryptol. 24(1): 24-41 (2011) - 2010
- [c6]Andreas Enge, Andrew V. Sutherland:
Class Invariants by the CRT Method. ANTS 2010: 142-156 - [i9]Andreas Enge, Andrew V. Sutherland:
Class Invariants by the CRT Method. IACR Cryptol. ePrint Arch. 2010: 31 (2010)
2000 – 2009
- 2009
- [j8]Andreas Enge:
The complexity of class polynomial computation via floating point approximations. Math. Comput. 78(266): 1089-1107 (2009) - [j7]Andreas Enge:
Computing modular polynomials in quasi-linear time. Math. Comput. 78(267): 1809-1824 (2009) - [r1]Andreas Enge:
Volume Computation for Polytopes: Strategies and Performances. Encyclopedia of Optimization 2009: 4032-4038 - [i8]Andreas Enge, Pierrick Gaudry, Emmanuel Thomé:
An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves. CoRR abs/0905.2177 (2009) - 2008
- [c5]Juliana Belding, Reinier Bröker, Andreas Enge, Kristin E. Lauter:
Computing Hilbert Class Polynomials. ANTS 2008: 282-295 - [i7]Juliana Belding, Reinier Bröker, Andreas Enge, Kristin E. Lauter:
Computing Hilbert Class Polynomials. IACR Cryptol. ePrint Arch. 2008: 62 (2008) - 2007
- [c4]Andreas Enge, Pierrick Gaudry:
An L (1/3 + epsilon ) Algorithm for the Discrete Logarithm Problem for Low Degree Curves. EUROCRYPT 2007: 379-393 - [i6]Andreas Enge:
Computing modular polynomials in quasi-linear time. CoRR abs/0704.3177 (2007) - [i5]Andreas Enge:
Discrete logarithms in curves over finite fields. CoRR abs/0712.3916 (2007) - [i4]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
- [j6]Régis Dupont, Andreas Enge:
Provably secure non-interactive key distribution based on pairings. Discret. Appl. Math. 154(2): 270-276 (2006) - [i3]Andreas Enge:
The complexity of class polynomial computation via floating point approximations. CoRR abs/cs/0601104 (2006) - 2005
- [j5]Régis Dupont, Andreas Enge, François Morain:
Building Curves with Arbitrary Small MOV Degree over Finite Prime Fields. J. Cryptol. 18(2): 79-89 (2005) - [j4]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
- [c3]Abdolali Basiri, Andreas Enge, Jean-Charles Faugère, Nicolas Gürel:
Implementing the Arithmetic of C3, 4Curves. ANTS 2004: 87-101 - 2003
- [c2]Andreas Enge, François Morain:
Fast Decomposition of Polynomials with Known Galois Group. AAECC 2003: 254-264 - 2002
- [j3]Andreas Enge:
Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time. Math. Comput. 71(238): 729-742 (2002) - [j2]Andreas Enge, Andreas Stein:
Smooth ideals in hyperelliptic function fields. Math. Comput. 71(239): 1219-1230 (2002) - [c1]Andreas Enge, François Morain:
Comparing Invariants for Class Fields of Imaginary Quadratic Fields. ANTS 2002: 252-266 - [i2]Régis Dupont, Andreas Enge, François Morain:
Building curves with arbitrary small MOV degree over finite prime fields. IACR Cryptol. ePrint Arch. 2002: 94 (2002) - [i1]Régis Dupont, Andreas Enge:
Practical Non-Interactive Key Distribution Based on Pairings. IACR Cryptol. ePrint Arch. 2002: 136 (2002) - 2001
- [j1]Andreas Enge:
The Extended Euclidian Algorithm on Polynomials, and the Computational Efficiency of Hyperelliptic Cryptosystems. Des. Codes Cryptogr. 23(1): 53-74 (2001) - 2000
- [b2]Andreas Enge:
Hyperelliptic cryptosystems: efficiency and subexponential attacks. University of Augsburg, Germany, 2000, ISBN 978-3-8311-1868-7, pp. 1-151
1990 – 1999
- 1999
- [b1]Andreas Enge:
Elliptic Curves and Their Applications to Cryptography - an introduction. Kluwer 1999, ISBN 978-0-7923-8589-9, pp. I-XVI, 1-164
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-29 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
