Speeding up the Scalar Multiplication in the Jacobians of Hyperelliptic Curves Using Frobenius Map

Authors:
YoungJu Choie;Jong Won Lee
Affiliations:
-;-
Venue:
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Year:
2002

Citing 12
Cited 2

Hyperelliptic cryptosystems

Journal of Cryptology
A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves

Mathematics of Computation
Algebraic aspects of cryptography

Algebraic aspects of cryptography
On the discrete logarithm in the divisor class group of curves

Mathematics of Computation
A subexponential algorithm for discrete logarithms over hyperelliptic curves of large genus over GF (q)

Theoretical Computer Science - Special issue: cryptography
Efficient Arithmetic on Koblitz Curves

Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
The Extended Euclidian Algorithm on Polynomials,and the Computational Efficiency of Hyperelliptic Cryptosystems

Designs, Codes and Cryptography
Speeding up the Arithmetic on Koblitz Curves of Genus Two

SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
CM-Curves with Good Cryptographic Properties

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Algebraic Function Fields and Codes

Algebraic Function Fields and Codes
Fast elliptic curve algorithm combining Frobenius map and table reference to adapt to higher characteristic

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
An algorithm for solving the discrete log problem on hyperelliptic curves

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

Skew-Frobenius Maps on Hyperelliptic Curves

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Koblitz curve cryptosystems

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In [8] Koblitz suggested to make use of a Frobenius expansion to speed up the scalar multiplications in the Jacobians of hyperelliptic curves over the characteristic 2 field. Recently, G眉nther et. al.[6] have modified Koblitz's Frobenius expansion method and applied it to the Koblitz curves of genus 2 over F2 to speed up the scalar multiplication. In this paper, we show that the method given in [6] can be extended to the case when the hyperelliptic curves are defined over the finite field of any characteristic. For cryptographic purposes, we restrict our interest only to those with genus 2, 3, 4. We give a theoretical efficiency of our method by comparing to the double-and-add method over the Jacobians. As a result, with some reference tables we can reduce the cost of double-and-add method to nearly 41%.