Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Enge, Andreas
108  Ergebnisse:
Personensuche X
?
1

Bilinear pairings on elliptic curves:

Enge, Andreas
L'Enseignement Mathématique.  61 (2016)  1 - p. 211-243 , 2016
Link: https://doi.org/10.4171/..
 
?
2

Computing Class Polynomials for Abelian Surfaces:

Enge, Andreas ; Thomé, Emmanuel
Experimental Mathematics.  23 (2014)  2 - p. 129-145 , 2014
Link: https://doi.org/10.1080/..
 
?
3

An L(1/3) Discrete Logarithm Algorithm for Low Degree Curve:

Enge, Andreas ; Gaudry, Pierrick ; Thomé, Emmanuel
Journal of Cryptology.  24 (2010)  1 - p. 24-41 , 2010
Link: https://doi.org/10.1007/..
 
?
4

Computing Modular Polynomials in Quasi-Linear Time:

Enge, Andreas
Mathematics of Computation.  78 (2009)  267 - p. 1809-1824 , 2009
Link: https://www.jstor.org/st..
 
?
5

The Complexity of Class Polynomial Computation via Floating..:

Enge, Andreas
Mathematics of Computation.  78 (2009)  266 - p. 1089-1107 , 2009
Link: https://www.jstor.org/st..
 
?
6

Provably secure non-interactive key distribution based on p..:

Dupont, Régis ; Enge, Andreas
Discrete Applied Mathematics.  154 (2006)  2 - p. 270-276 , 2006
Link: https://doi.org/10.1016/..
 
?
7

The Arithmetic of Jacobian Groups of Superelliptic Cubics:

Abdolali Basiri ; Enge, Andreas ; Jean-Charles Faugère.
Mathematics of Computation.  74 (2005)  249 - p. 389-410 , 2005
Link: https://www.jstor.org/st..
 
?
8

Constructing elliptic curves over finite fields using doubl..:

Enge, Andreas ; Schertz, Reinhard
Journal de Théorie des Nombres de Bordeaux.  16 (2004)  3 - p. 555-568 , 2004
Link: https://doi.org/10.5802/..
 
?
9

Constructing elliptic curves over finite fields using doubl..:

ENGE, Andreas ; SCHERTZ, Reinhard
Journal de Théorie des Nombres de Bordeaux.  16 (2004)  3 - p. 555-568 , 2004
Link: https://www.jstor.org/st..
 
?
10

Building Curves with Arbitrary Small MOV Degree over Finite..:

Dupont, Régis ; Enge, Andreas ; Morain, François
Journal of Cryptology.  18 (2004)  2 - p. 79-89 , 2004
Link: https://doi.org/10.1007/..
 
?
11

Smooth Ideals in Hyperelliptic Function Fields:

Enge, Andreas ; Stein, Andreas
Mathematics of Computation.  71 (2002)  239 - p. 1219-1230 , 2002
Link: https://www.jstor.org/st..
 
?
12

Computing Discrete Logarithms in High-Genus Hyperelliptic J..:

Enge, Andreas
Mathematics of Computation.  71 (2002)  238 - p. 729-742 , 2002
Link: https://www.jstor.org/st..
 
?
13

The extended Euclidian algorithm on polynomials, and the ef.. 

Report / Universität Augsburg, Institut für Mathematik ; No. 410
Enge, Andreas , 1999
Exemplar:  Zentrale:Magazin bc 1018-410
 
?
14

[Re] Volume computation for polytopes: Vingt ans après:

Enge, Andreas
info:eu-repo/semantics/altIdentifier/doi/10.5281/zenodo.4242972.  , 2020
Link: https://hal.inria.fr/hal..
 
?
15

Short addition sequences for theta functions:

Enge, Andreas ; Hart, William ; Johansson, Fredrik
info:eu-repo/semantics/altIdentifier/arxiv/1608.06810.  , 2018
Link: https://hal.inria.fr/hal..
 
1-15