31 search results - page 1 / 7 » Improved Algorithms for Efficient Arithmetic on Elliptic Cur... |
EUROCRYPT
2003
Springer
13 years 9 months ago
2003
Springer
DCC
2000
IEEE
13 years 4 months ago
2000
IEEE
It has become increasingly common to implement discrete-logarithm based public-key protocols on elliptic curves over finite fields. The basic operation is scalar multiplication: ta...
CTRSA
2003
Springer
13 years 9 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...
PKC
1998
Springer
13 years 8 months ago
1998
Springer
In this paper, we present two efficient algorithms computing scalar multiplications of a point in an elliptic curve defined over a small finite field, the Frobenius map of which ha...
ICICS
1997
Springer
13 years 8 months ago
1997
Springer
Elliptic curve cryptosystems, proposed by Koblitz([8]) and Miller([11]), can be constructed over a smaller definition field than the ElGamal cryptosystems([5]) or the RSA cryptosys...