37 search results - page 1 / 8 » Fast algorithms for computing isogenies between elliptic cur... |
CORR
2006
Springer
13 years 4 months ago
2006
Springer
We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an...
ANTS
2010
Springer
13 years 8 months ago
2010
Springer
An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between ellip...
AAECC
2003
Springer
13 years 8 months ago
2003
Springer
Elliptic curve cryptosystems are usually implemented over fields of characteristic two or over (large) prime fields. For large prime fields, projective coordinates are more suitabl...
ACSW
2007
13 years 6 months ago
2007
The security of most elliptic curve cryptosystems is based on the intractability of the Elliptic Curve Discrete Logarithm Problem (ECDLP). Such a problem turns out to be computati...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Given two elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit an isogeny between them, but finding such an isog...