Sciweavers

16 search results - page 2 / 4
» Short Memory Scalar Multiplication on Koblitz Curves
Sort
View
ASIACRYPT
2006
Springer
14 years 1 months ago
Extending Scalar Multiplication Using Double Bases
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...
Roberto Maria Avanzi, Vassil S. Dimitrov, Christop...
IJNSEC
2006
131views more  IJNSEC 2006»
13 years 9 months ago
A Frobenius Map Approach for an Efficient and Secure Multiplication on Koblitz
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 ...
Mustapha Hedabou
EUROCRYPT
2009
Springer
14 years 10 months ago
Double-Base Number System for Multi-scalar Multiplications
Abstract. The Joint Sparse Form is currently the standard representation system to perform multi-scalar multiplications of the form [n]P + m[Q]. We introduce the concept of Joint D...
Christophe Doche, David R. Kohel, Francesco Sica
CHES
2010
Springer
183views Cryptology» more  CHES 2010»
13 years 9 months ago
Coordinate Blinding over Large Prime Fields
In this paper we propose a multiplicative blinding scheme for protecting implementations of a scalar multiplication over elliptic curves. Specifically, this blinding method applies...
Michael Tunstall, Marc Joye
CARDIS
2000
Springer
124views Hardware» more  CARDIS 2000»
14 years 1 months ago
Elliptic Curve Cryptography on Smart Cards without Coprocessors
Abstract This contribution describes how an elliptic curve cryptosystem can be implemented on very low cost microprocessors with reasonable performance. We focus in this paper on t...
Adam D. Woodbury, Daniel V. Bailey, Christof Paar