16 search results - page 2 / 4 » Parallel Formulations of Scalar Multiplication on Koblitz Cu... |
ASIACRYPT
2006
Springer
13 years 8 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...
IJNSEC
2006
13 years 4 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 ...
EUROCRYPT
2009
Springer
14 years 5 months ago
2009
Springer
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...
CARDIS
2000
Springer
13 years 9 months ago
2000
Springer
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...
CHES
2004
Springer
13 years 10 months ago
2004
Springer
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...