18 search results - page 1 / 4 » Fast Point Multiplication on Elliptic Curves through Isogeni... |
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...
PKC
2004
Springer
13 years 10 months ago
2004
Springer
The isogeny for elliptic curve cryptosystems was initially used for the efficient improvement of order counting methods. Recently, Smart proposed the countermeasure using isogeny f...
AMC
2006
13 years 5 months ago
2006
The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scalar multiplication. Based on the double-base chain representation of scalar using...
CTRSA
2003
Springer
13 years 10 months ago
2003
Springer
We present an algorithm which speeds scalar multiplication on a general elliptic curve by an estimated 3.8% to 8.5% over the best known general methods when using affine coordinate...
IJNSEC
2006
13 years 4 months ago
2006
The main back-bone operation in elliptic curve cryptosystems is scalar point multiplication. The most frequently used method implementing the scalar point multiplication which is ...