Abstract
In the implementation of hyperelliptic curve cryptosystems, a siginificant step is the selection of secure hyperelliptic curves on which the Jacobian is constructed. In this paper, we discuss the hyperelliptic curves ofg=2 such asv 2+uv=f andv 2+v=f(u) defined onGF(2r). The curves defined onGF(4) andGF(8) are expanded to the curves defined onGF(4)k andGF(8)t respectively, where 38<k<70, 25<t<50. We also find out all the secure curves ofg=2 that are suitable for establishing cryptosystems.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Koblitz N. Elliptic curve cryptosystems.Mathematics of Computation, 1987, 48(177): 203–209.
Koblitz N. Hyperelliptic cryptography.Journal of Cryptology, 1989, (1): 139–150.
Cantor D G. Computing in the Jacobian of a hyperelliptic curve.Mathematics of Computation, 1987, 48: 95–101.
Frey G, Rück H. A remark concerningm-divisibility and the discrete logarithm in the divisor class group of curves.Mathematics of Computation, 1994, 62: 865–874.
Sakai Y, Sakurai K, Ishizuka H. Secure hyperelliptic cryptosystems and their performance. InPKC’98, Imai H, Zheng Y (eds.), Springer-Verlag, LNCS 1431, Pacifico Yokohama, Japan, February, 1998, pp. 164–181.
Koblitz N. Algebraic Aspects of Cryptography. New York: Springer-Verlag, 1998.
Menezes A, Wu Y, Zuccherato R. An elementary introduction to hyperelliptic curves. Available at http://www.cacr.math.uwaterloo.ca/techreports/1997/tech_reports97.html
Itoh Toshiya, Sakurai Kouichi, Shizuya Hiruki. On the complexity of hyperelliptic discrete logarithm problem. InAdvances in EUROCRYPT’91, LNCS 547, Springer-Verlag, Brighton, UK, 1991, pp.337–351.
Adleman L, DeMarrais J, Huang M. A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields. InAlgorithmic Number Theory (ANTS-1), LNCS 877, Springer-Verlag, Ithaca, New York, 1994, pp.28–40.
Gaudry P. An algorithm for solving the discrete log problem on hyperelliptic curves. InEurocrypt 2000, Preneel B (ed.), LNCS 1807, Springer-Verlag, Bruges, Belgium, May, 2000, pp.19–34.
Ruck H G. On the discrete logarithms in the divosor class group of curves.Mathematics Computation, 1999, 68: 805–806.
Galbraith S D. Supersingular curves in cryptography. Available at http://www.cs.bris.ac.uk/~stenve
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by the National NKBRSF ‘973’ Program of China (Grant No.G1999035804).
ZHANG Fangguo was born in 1972. He received the B.S. degree in mathematics from Yantai Teachers’ University in 1996 and the M.S. degree in applied mathematics from Tongji University in 1999. He is currently a Ph.D. candidate in cryptography at Xidian University. His research interests are electronic commerce, elliptic curve cryptography and hyperelliptic curve cryptography.
ZHANG Futai was born in 1965. He received the M.S. degree in fundamental mathematics from Shanxi Normal University in 1990. He is currently a Ph.D. candidate in cryptography at Xidian University. His research interests are information security, cryptography and electronic commerce.
WANG Yumin was born in 1936. He is now a professor, a Ph.D. supervisor in Xidian University, and a member of IEEE. His research interests are the philosophy of communication, information theory, coding and cryptography.
Rights and permissions
About this article
Cite this article
Zhang, F., Zhang, F. & Wang, Y. Selection of secure hyperelliptic curves ofg=2 based on a subfield. J. Compt. Sci. & Technol. 17, 836–842 (2002). https://doi.org/10.1007/BF02960774
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02960774