28 search results - page 2 / 6 » Two Efficient Algorithms for Arithmetic of Elliptic Curves U... |
EUROCRYPT
2003
Springer
13 years 10 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...
IJNSEC
2006
13 years 5 months ago
2006
The most efficient technique for protecting the using Frobenius algorithms for scalar multiplication on Koblitz curves against the Side Channel Attacks seems to be the multiplier ...
ASIACRYPT
1999
Springer
13 years 9 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...
MASCOTS
2001
13 years 6 months ago
2001
As the Internet commerce becomes a more important part of the economy, network security is receiving more emphasis. Time spent in data encryption can be a significant performance ...