Sciweavers

36 search results - page 2 / 8
» A Binary Redundant Scalar Point Multiplication in Secure Ell...
Sort
View
AAECC
2003
Springer
165views Algorithms» more  AAECC 2003»
13 years 9 months ago
Fast Point Multiplication on Elliptic Curves through Isogenies
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...
Eric Brier, Marc Joye
TC
2011
12 years 12 months ago
Hybrid Binary-Ternary Number System for Elliptic Curve Cryptosystems
—Single and double scalar multiplications are the most computational intensive operations in elliptic curve based cryptosystems. Improving the performance of these operations is ...
Jithra Adikari, Vassil S. Dimitrov, Laurent Imbert
CHES
2004
Springer
182views Cryptology» more  CHES 2004»
13 years 11 months ago
Pipelined Computation of Scalar Multiplication in Elliptic Curve Cryptosystems
In the current work we propose a pipelining scheme for implementing Elliptic Curve Cryptosystems (ECC). The scalar multiplication is the dominant operation in ECC. It is computed b...
Pradeep Kumar Mishra
FDTC
2006
Springer
106views Cryptology» more  FDTC 2006»
13 years 9 months ago
Sign Change Fault Attacks on Elliptic Curve Cryptosystems
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...
Johannes Blömer, Martin Otto 0002, Jean-Pierr...
DCC
2000
IEEE
13 years 5 months ago
Efficient Arithmetic on Koblitz Curves
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...
Jerome A. Solinas