3[2]V S Miller. Use of elliptic curve in cryptography [ A].In GRYPTO'85( Santa Barbara, Calif., 1985 ), LNCS. 218 [ C ], Spring- Verlag. 1986:417 - 426.
4[3]N Koblitz. Hyperelliptic cryptography [ J ]. J. of Crypto., 1989, 1 (3):139- 150.
5[4]D G Cantor. Computing in the jacobian of a hyperelliptic curve [J].Math. Comp., 1987,48:95 - 101.
6[5]N Koblitz. Algebraic Aspects of Cryptography [ M]. Algorithms and Comutation in Math.3,Springer-Verlag 1998.
7[6]Mumford D. Tata Lectures on Theta Ⅱ [ M ]. Birkhauser-Verlag,Boston. 1984.
8[7]Paulus Ruck, H -G. Real and imaginary quadratic representations of hvperelliptic fmction fields logarithms [ J ]. Math. Comp., 1999, 68:1233 - 1241.
9[8]A Stein. Sharp upper bound for arithmetics in hyperelliptic function rields [ R ]. Techn. Report CORR # 99-23, University of Waterloo (2000) ,68 pages. http://www. cacr. math. uwaterloo. ca.
10[9]Andreas Enge. The extended euclidian algorithm on polynomials, and the computational efficiency of hyperelliptic cryptosystems. http://www. math. umi-augsburg. de/～ enge/Publikationen. html.
