65 search results - page 6 / 13 » Atomicity Improvement for Elliptic Curve Scalar Multiplicati... |
PKC
2004
Springer
14 years 1 months ago
2004
Springer
Let E be an elliptic curve defined over F2n . The inverse operation of point doubling, called point halving, can be done up to three times as fast as doubling. Some authors have t...
ASAP
2006
IEEE
14 years 2 months ago
2006
IEEE
This paper proposes different low-cost coprocessors for public key authentication on 8-bit smart cards. Elliptic curve cryptography is used for its efficiency per bit of key and ...
CHES
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We propose a superscalar coprocessor for high-speed curvebased cryptography. It accelerates scalar multiplication by exploiting instruction-level parallelism (ILP) dynami...
IEICET
2008
13 years 8 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...