Speeding up the Scalar Multiplication in the Jacobians of Hyperelliptic Curves Using Frobenius Map
作者： YoungJu Choie , Jong Won Lee
关键词:
摘要: In [8] Koblitz suggested to make use of a Frobenius expansion speed up the scalar multiplications in Jacobians hyperelliptic curves over characteristic 2 field. Recently, Gunther et. al.[6] have modified Koblitz's method and applied it genus F2 multiplication. this paper, we show that given [6] can be extended case when are defined finite field any characteristic. For cryptographic purposes, restrict our interest only those with 2, 3, 4. We give theoretical efficiency by comparing double-and-add Jacobians. As result, some reference tables reduce cost nearly 41%.
springer.com
acm.org 
sci-hub.st 参考文章(19)
David Mumford, Tata Lectures on Theta I ,(1982)
Pierrick Gaudry, An algorithm for solving the discrete log problem on hyperelliptic curves theory and application of cryptographic techniques. ,vol. 1807, pp. 19- 34 ,(2000) , 10.1007/3-540-45539-6_2
Andreas Enge, The Extended Euclidian Algorithm on Polynomials,and the Computational Efficiency of Hyperelliptic Cryptosystems Designs, Codes and Cryptography. ,vol. 23, pp. 53- 74 ,(2001) , 10.1023/A:1011215802656
Andreas Stein, University of Waterloo. Dept. of Combinatorics and Optimization, University of Waterloo. Faculty of Mathematics, Tanja Lange, Speeding up the Arithmetic on Koblitz Curves of Genus Two selected areas in cryptography. pp. 106- 117 ,(2000) , 10.1007/3-540-44983-3_8
Tetsutaro Kobayashi, Hikaru Morita, Kunio Kobayashi, Fumitaka Hoshino, Fast elliptic curve algorithm combining Frobenius map and table reference to adapt to higher characteristic theory and application of cryptographic techniques. pp. 176- 189 ,(1999) , 10.1007/3-540-48910-X_13
Henning Stichtenoth, Algebraic Function Fields and Codes ,(1993)
Volker Müller, Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two Journal of Cryptology. ,vol. 11, pp. 219- 234 ,(1998) , 10.1007/S001459900045
David G. Cantor, Computing in the Jacobian of a hyperelliptic curve Mathematics of Computation. ,vol. 48, pp. 95- 101 ,(1987) , 10.1090/S0025-5718-1987-0866101-0
Hans-Georg Rück, On the discrete logarithm in the divisor class group of curves Mathematics of Computation. ,vol. 68, pp. 805- 806 ,(1999) , 10.1090/S0025-5718-99-01043-1
Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh Huang, A subexponential algorithm for discrete logarithms over hyperelliptic curves of large genus over GF ( q ) Theoretical Computer Science. ,vol. 226, pp. 7- 18 ,(1999) , 10.1016/S0304-3975(99)00061-4