6 search results - page 1 / 2 » Koblitz Curves and Integer Equivalents of Frobenius Expansio... |
SACRYPT
2007
Springer
15 years 3 months ago
2007
Springer
86
Voted
PKC
2004
Springer
15 years 2 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...
93
Voted
ALGORITHMICA
2006
14 years 9 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...
72
Voted
CHES
2006
Springer
15 years 1 months ago
2006
Springer
We describe algorithms for point multiplication on Koblitz curves using multiple-base expansions of the form k =
DCC
2000
IEEE
14 years 9 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...