Abstract
Construction of secure hyperelliptic curves is of most important yet most dificult problem in design of cryptosystems based on the discrete logarithm problems on hyperelliptic curves. Presently the only accessible approach is to use CM curves. However, to find models of the CM curves is nontrivial. The popular approach uses theta functions to derive a projective embedding of the Jacobian varieties, which needs to calculate the theta functions to very high precision. As we show in this paper, it costs computation time of an exponential function in the discriminant of the CM field. This paper presents new algorithms to find explicit models of hyperelliptic curves with CM. Algorithms for CM test of Jacobian varieties of algebraic curves and to lift from small finite fields both the models and the invariants of CM curves are presented. We also show that the proposed algorithm for invariants lifting has complexity of a polynomial time in the discriminant of the CM field.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
L. M. Adleman, M. D. A. Huang, “Primality Testing and Abelian Varieties Over Finite Fields,” Springer-Verlag, (1992.)
L. M. Adleman, J. DeMarrais, M. D. Huang, “A Subexponential Algorithms for Discrete Logarithms over the Rational Subgroup of the Jacobians of Large Genus Hyperelliptic Curves over Finite Fields,” Proc. of ANTS95, Springer, (1995)
L. M. Adleman, M. D. Huang, “Counting rational points on curves and Abelian varieties over finite fields” Henri Cohen (Ed) “Algorithmic number theory” Lecture Notes in Computer Science, 1122, Second International Symposium, ANTS-II, Proceedings, p.1–16. 1996
S. Arita, “Public key cryptosystems with C ab curve (II)” IEICE, Symposium on Cryptography and Information Security, SCIS’98, 7.1–B, 1998–1.
A. O. L. Atkin, F. Morain, “Elliptic Curves and Primality Proving”, Research Report 1256, INRIA, (1990).
D. Cantor, “Computing in the jacobian of hyperelliptic curve,” Math. Comp., vol.48, p.95–101, (1987)
J. Chao, N. Matsuda, S. Tsujii, “Efficient construction of secure hyperelliptic discrete logarithm problems” Springer-Verlag Lecture Notes on Computer Science, Vol.1334, pp.292–301, “Information and Communication Security” Y. Han, T. Okamoto, S. Qing (Eds.) Proceedings of First International Conference ICICS’97, Beijing, China, Nov. 1997.
J. Chao, K. Matsuo, S. Tsujii “Fast construction of secure discrete logarithm problems over Jacobian varieties,” Information Security for Global Information Infrastructures: IFIP TC 11 16th Annual Working Conference on Information Security, S. Qing and J. Elo. (Eds.), Kluwer, July 2000.
H. Cohen “A course in computational algebraic number theory,” Springer, GTM-138, 1995.
J. de Jong, R. Noot, “Jacobians with complex multiplication,” Arithmetic Algebraic Geometry, Birkhäuser PM89, pp.177–192, 1991.
Duursma, Gaudry, Morain, “Speeding up the discrete log computation on curves with automorphism”, Proceeding. Asiacrypt-99, 1999.
G. Frey, H.G. Rück, “A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves,” Math. Comp., 62, 865–874, 1994.
G. Frey, M. Müller, “Arithmetic of modular curves and applications,” Preprint, 1998.
P. Gaudry “A variant of the Adelman-DeMarrais-Huang algorithm and its application to small genera,” Preliminary version, June 1999.
P. Gaudry, R. Harley, “Counting points on hyperelliptic curves over finite fields,” Preprint, 2000.
T. Haga, K. Matsuo, J. Chao, S. Tsujii, “Construction of CM hyperelliptic curves using ordinary lifting,” Proc. of SCIS’2000, IEICE Japan, 2000.
M. D. Huang, D. Ierardi, “Counting Rational Point on Curves over Finite Fields,” Proc. 32nd IEEE Symp. on the Foundations of Computers Science, 1993.
J. Igusa, “Arithmetic variety of for genus two,” Ann. of Math., vol.72, No.3, p.612–649, (1960)
K. Kamio, H. Kawashiro, J. Chao, S. Tsujii, “A fast algorithm of model lifting for CM hyperelliptic curves,” Proc. SCIS’99, IEICE, Japan, 1999.
N. Koblitz, “Hyperelliptic cryptosystems,” J. of Cryptology, vol.1, p.139–150, (1989)
S. Lang, “Complex multiplication,” Springer-Verlag, (1983)
K. Matsuo, J. Chao and S. Tsujii, “On lifting of CM hyperelliptic curves,” Proc. of SCIS’99, W3-1.4, IEICE Japan (1999).
A. Menezes, S. Vanstone, T. Okamoto, “Reducing Elliptic Curve Logarithms to Logarithms in a Finite Fields,” Proc. of STOC, p.80–89, (1991).
V. Müller, A. Stein, C. Thiel, “Computing discrete logarithms in real quadratic congruence function fields of large genus,” Preprint, Nov. 13, (1997)
D. Mumford, “Tata Lectures on Theta I,” Birkhäuser, Boston, (1983).
D. Mumford, “Tata Lectures on Theta II,” Birkhäuser, Boston, (1984).
K. Nagao, “Construction of the Jacobians of Curves Y 2 = X 5 +k /F p with Prime Order,” Manuscript, 1998.
O. Nakamura, N. Matsuda, J. Chao, S. Tsujii, “On cryptosystems based on abeian varieties with CM,” IEICE, Symposium on Cryptography and Information Security, SCIS’97, 12-E, 1997–1. IEICE, Tech. rep. ISEC-96-81, 1997–3.
J. Pila, “Frobenius maps of abelian varieties and finding roots of unity in finite fields,” Math. Comp., vol.55, p. 745–763, (1990)
H. G. Rück, “on the discrete logarithm problem in the divisor class group of curves,” Preprint, 1997.
J. P. Serre, J. Tate, “Good reduction of abelian varieties,” Ann. of Math. (2), 88 (1968), page 492–517.
G. Shimura: “Abelian Varieties with Complex Multiplication and Modular Functions”, Princeton Univ. Press, 1998.
A-M. Spallek, “Kurven vom Geschlecht 2 und ihre Anwendung in Public-Key-Kryptosystemen,” Dissertation, preprint, No. 18, 1994.
J. Tate, “Endomorphisms of Abelian varieties over finite fields,” Invent. Math. 2, p.134–144, (1966)
E. J. Volcheck, “Computing in the Jacobian of a plane algebraic curve,” Proc. of ANT-1, p.221–233, LNCS-877, (1994).
P. V. Wamelen, “Examples of genus two CM curves defined over the rationals,” Math. Comp., 68(225), pp. 308–320, 1999.
P. S. Wang, “A p-adic algorithm for univariate partial fractions,” Proc. of ACM SYMSAC’81, ACM, 212–217, 1981.
X. Wang, “2-dimensional simple factors of J o (N),” Manuscripta Mathematica, 87:179–197, 1995.
H. J. Weber, “Hyperellptic simple factors of J o (N) with dimension at least 3,” Experimental Math. vol. 6, No.4, 273–287, 1997.
H. Yoshida, “Hecke characters and models of abelian varieties with complex multiplication,” J. Fac. Sci. Univ. of Tokyo, Sec. IA, 28, 633–649 (1982).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chao, J., Matsuo, K., Kawashiro, H., Tsujii, S. (2000). Construction of Hyperelliptic Curves with CM and Its Application to Cryptosystems. In: Okamoto, T. (eds) Advances in Cryptology — ASIACRYPT 2000. ASIACRYPT 2000. Lecture Notes in Computer Science, vol 1976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44448-3_20
Download citation
DOI: https://doi.org/10.1007/3-540-44448-3_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41404-9
Online ISBN: 978-3-540-44448-0
eBook Packages: Springer Book Archive