Efficient Scalar Multiplication in Hyperelliptic Curves Using A New Frobenius Expansion

Abstract

The Frobenius expansion has been used to speed up scalar multiplication in hyperelliptic curves as it is used in elliptic curves. In this paper we propose a new Probenius expansion method for hyperelliptic curves that have efficiently computable endomorphisms used in Park, Jeong and Lim [l]. When our method is applied to scalar multiplication for hyperelliptic curves, the number of divisor doublings in a scalar multiplication is reduced to a quarter, while the number of divisor additions is almost the same. Our experiments show that the overall throughputs of scalar multiplications are increased by 15.6-28.3% over the previous algorithm, when the algorithms are implemented over finite fields of odd characteristics. © Springer-Verlag 2004.