Abstract
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. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Labrande, H., & Jacobson, M. J. (2012). Sublinear scalar multiplication on hyperelliptic Koblitz curves. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7118 LNCS, pp. 399–411). Springer Verlag. https://doi.org/10.1007/978-3-642-28496-0_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
