74 search results - page 7 / 15 » High-Performance Architecture of Elliptic Curve Scalar Multi... |
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
Recently, Eisentr?ager et al. proposed a very elegant method for speeding up scalar multiplication on elliptic curves. Their method relies on improved formulas for evaluating S = (...
TC
2011
13 years 1 months ago
2011
—Single and double scalar multiplications are the most computational intensive operations in elliptic curve based cryptosystems. Improving the performance of these operations is ...
ASIACRYPT
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. It has been recently acknowledged [4, 6, 9] that the use of double bases representations of scalars n, that is an expression of the form n = e,s,t(-1)e As Bt can speed up...
IEICET
2008
13 years 7 months ago
2008
The hyperelliptic curve cryptosystems take most of the time for computing a scalar multiplication kD of an element D in the Jacobian JC of a hyperelliptic curve C for an integer k....
FDTC
2006
Springer
13 years 11 months ago
2006
Springer
We present a new type of fault attacks on elliptic curve scalar multiplications: Sign Change Attacks. These attacks exploit different number representations as they are often emplo...