31 search results - page 1 / 7 » Fast Multiplication on Elliptic Curves over Small Fields of ... |
JOC
1998
13 years 10 months ago
1998
AAECC
2003
Springer
14 years 2 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...
INDOCRYPT
2001
Springer
14 years 3 months ago
2001
Springer
In this paper, the authors analyze the Gaudry–Hess–Smart (GHS) Weil descent attack on the elliptic curve discrete logarithm problem (ECDLP) for elliptic curves defined over c...
ASIACRYPT
2000
Springer
14 years 3 months ago
2000
Springer
The paper shows that some of elliptic curves over finite fields of characteristic three of composite degree are attacked by a more effective algorithm than Pollard’s ρ method...
ASIACRYPT
1999
Springer
14 years 3 months ago
1999
Springer
In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We pres...