Speeding up point multiplication on hyperelliptic curves with efficiently-computable endomorphisms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2332, Issue , 2002, Pages 197-208

  Park, Young Ho ^a   Jeong, Sangtae ^b   Lim, Jongin ^c  

^a Sejong Cyber University   (South Korea)

^b Seoul National University   (South Korea)

^c Korea University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; GEOMETRY;

FINITE FIELDS; GENERAL METHOD; HYPER-ELLIPTIC CURVES; KOBLITZ CURVES; POINT MULTIPLICATION;

CURVE FITTING;

EID: 84947275198     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46035-7_13     Document Type: Conference Paper

References (28)

1. L. Adleman, J. DeMarrais, M-D. Hwang, “A Subexponential algorithms for Discrete Logarithms over the Rational Subgroups of the Jacobians of Large Genus Hyperelliptic Curves over Finite fields”, ANTS-I, LNCS 77 (Springer) 1994, 28-40.
2. I. Blake, G. Seroussi, N. Smart: ‘Elliptic Curves in Cryptography’, London Mathematical Society Lecture Note Series. 265, Cambridge University Press, 1999.
3. J. Buhler, N. Koblitz, “Lattice Basis Reduction, Jacobi Sums and Hyperelliptic Cryptoststems”, Bull. Austral. Math. Soc., 57, 147-154.
4. D. Cantor, “Computing in the Jacobian of A Hyperelliptic curve”, Mathematics of Computation, 48(1987), 95-101.
5. I. Duursma, P. Gaudry, F. Morain, “Speeding up the discrete log computation on curves with automorphisms”, Advances in Cryptology, Asiacrypt’99 LNCS 1716 (Springer), 1999, 103-121.
6. A. Enge, “Computing discrete logarithms in high-genus hyperelliptic Jacobian in provably subexponential time”, University of Waterloo Technical Report CORR99-04, 2000.
7. G. Frey, H.-G. Ruck, “A Reamrk concerning m-Divisibility and the Discrete logarithm Problems in the Divisor Class Group of Curves”, Mathematics of Computation 62, 1994, 865-874.
8. R. Gallant, R. Lambert, S. Vanstone, “Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms”, Advances in Cryptology-Crypto 2001, LNCS 2139 (Springer), 2001, 190-200.
9. P. Gaudry, “An algorithm for solving the discrete log problems on hyperelliptic curves”, Advances in Cryptology, Eurocrypt’2000, LNCS 1807 (Springer), 2000, 19-34.
10. C. Gunter, T. Lange, A. Stein, “Speeding up the Arithmetic on Koblitz Curves of Genus Two”, SAC 2000, LNCS 2012 (Springer), 2001, 106-117.
11. P. Gaudry, F. Hess, N.P. Smart,“Constructive and destructive facets of Weil Decent on elliptic curve”, Preprint (2000)
12. N. Koblitz, “CM-curves with good cryptographic properties,” Advances in Cryptology-Crypto’91, 1992, 279-287.
13. N. Koblitz, ’Algebraic Aspects of Cryptography’, Algorithms and Computations in Mathematics, 3, Springer-Verlag, 1998.
14. T. Lange,’Efficient Arithmetic on Hyperelliptic Koblitz Curves’, Ph.D. Thesis, University of Essen, 2001
15. W. Meier, O. Staffelbach, “Efficient multiplication on certain nonsupersingular elliptic curves”, Advances in Cryptology-Crypto’92, 1992, 333-344.
16. A. Menezes, M Qu, “Analysis of the Weil Descent Attack of Gaudry, Hess, and Smart”, TCT-RSA 2001, LNCS 2020 (Springer) 2001, 308-318.
17. B. Moller,“Algorithms for multi-exponentiation”, SAC 2001, 179-194.
18. V. Muller,“Fast multiplication in elliptic curves over small fields of characteristic two”, Journal of Cryptology, 11, 1998, 219-234.
19. V. Muller, A. Stein, C. Thiel,“Computing Discrete Logarithms in Real Quadratic Congruence Function Fields of Large Genus”, Mathematics of Computations 68, 1999, 807-822.
20. Y.-H. Park, S. Jeong, C. Kim, J. Lim,“An alternate decomposition of an integer for faster point multiplication on certain elliptic curves”, to appear PKC2002.
21. R.G. Ruck,“On the discrete logarithm in the divisor class group of curves”, Mathematics of Computations, 68, 1999, 805-806.
22. T. Satoh, K. Araki,“Fermat quotients and the polynomial time discrete log algotithm for anamalous elliptic curves”, Commentari Math. Univ. St. Pauli, 47, 1998, 81-92.
23. I.A. Semaev,“Evaluation of Discrete logathrims in a group of p-torsion points of an elliptic curves in characteristic p”, Mathematics of Computations, 67, 1998, 353-356.
24. N. Smart,“Elliptic curve cryptosystems over small fields of odd characteristic”, Journal of Cryptology, No 2 12, 1999, 141-145.
25. N. Smart, “The Disrete Logarithm Problem on Elliptic Curves of Trace One”, Journal of Cryptology, No 3 12, 1999, 193-196.
26. J. Solinas,“An improved algorithm for arithmetic on a family of elliptic curves,” Advances in Cryptology-Crypto ’97, 1997, 357-371.
27. J. Solinas, “Efficient arithmetic on Koblitz curves ”, Design, Codes and Cryptography, 19, 2000, 195-249.
28. A. Stein, “Sharp Upper Bounds for Arithmetics in Hyperelliptic Function Fields”, Techn. Report. CORR 99-23, University of Waterloo (1999), 68 pages.