16 search results - page 1 / 4 » Short Memory Scalar Multiplication on Koblitz Curves |
CHES
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We present a new method for computing the scalar multiplication on Koblitz curves. Our method is as fast as the fastest known technique but requires much less memory. We ...
DCC
2000
IEEE
13 years 10 months ago
2000
IEEE
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...
PKC
2004
Springer
14 years 4 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...
JUCS
2008
13 years 10 months ago
2008
We present an algorithm that by using the and -1 Frobenius operators concurrently allows us to obtain a parallelized version of the classical -and-add scalar multiplication algor...
ALGORITHMICA
2006
13 years 11 months ago
2006
Abstract. In this paper we prove the optimality and other properties of the -adic nonadjacent form: this expansion has been introduced in order to efficiently compute scalar multip...