Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
An algorithm for modular exponentiation
Information Processing Letters
Efficient Arithmetic on Koblitz Curves
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
CM-Curves with Good Cryptographic Properties
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
An Improved Algorithm for Arithmetic on a Family of Elliptic Curves
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Elliptic Scalar Multiplication Using Point Halving
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
On redundant T-adic expansions and non-adjacent digit sets
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
Extending scalar multiplication using double bases
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Efficient and secure elliptic curve point multiplication using double-base chains
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
An analysis of double base number systems and a sublinear scalar multiplication algorithm
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
FPGA implementation of point multiplication on koblitz curves using kleinian integers
CHES'06 Proceedings of the 8th international conference on Cryptographic Hardware and Embedded Systems
New minimal weight representations for left-to-right window methods
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Short memory scalar multiplication on koblitz curves
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
Double-Base Number System for Multi-scalar Multiplications
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
On redundant T-adic expansions and non-adjacent digit sets
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
Designs, Codes and Cryptography
Extending scalar multiplication using double bases
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
| Hi-index | 0.01 |
The paper is an examination of double-base decompositions of integers n, namely expansions loosely of the form $n = \sum_{i,j} \pm A^iB^j $ for some base {A,B}. This was examined in previous works [5,6], in the case when A,B lie in ℕ. We show here how to extend the results of [5] to Koblitz curves over binary fields. Namely, we obtain a sublinear scalar algorithm to compute, given a generic positive integer n and an elliptic curve point P, the point nP in time $O\left(\frac{\log n}{\log\log n}\right)$ elliptic curve operations with essentially no storage, thus making the method asymptotically faster than any know scalar multiplication algorithm on Koblitz curves. In view of combinatorial results, this is the best type of estimate with two bases, apart from the value of the constant in the O notation.