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
Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time
Mathematics of Computation
Speeding up the Arithmetic on Koblitz Curves of Genus Two
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
Computing Zeta Functions of Hyperelliptic Curves over Finite Fields of Characteristic 2
CRYPTO '02 Proceedings of the 22nd 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
Multiplication by a Constant is Sublinear
ARITH '07 Proceedings of the 18th IEEE Symposium on Computer Arithmetic
Provably Sublinear Point Multiplication on Koblitz Curves and Its Hardware Implementation
IEEE Transactions on Computers
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
Extending scalar multiplication using double bases
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition
Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition
| Hi-index | 0.00 |
Recently, Dimitrov et. al. [5] proposed a novel algorithm for scalar multiplication of points on elliptic Koblitz curves that requires a provably sublinear number of point additions in the size of the scalar. Following some ideas used by this article, most notably double-base expansions for integers, we generalize their methods to hyperelliptic Koblitz curves of arbitrary genus over any finite field, obtaining a scalar multiplication algorithm requiring a sublinear number of divisor additions.