Abstract
This paper proposes an algorithm which, given a basis of a subspace of the space of cuspforms of weight 2 for Γ0(N) which is invariant for the action of the Hecke operators, tests whether the subspace corresponds to a quotient A of the jacobian of the modular curve X 0(N) such that A is the jacobian of a curve C. Moreover, equations for such a curve C are computed which make the quotient suitable for applications in cryptography. One advantage of using such quotients of modular jacobians is that fast methods are known for finding their number of points over finite fields [6]. Our results extend ideas of M. Shimura [13] who used only the full modular jacobian instead of abelian quotients of it.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arbarello, E., Cornalba, M., Griffiths, P.A., Harris, J.: Geometry of Algebraic Curves, vol. 1. Springer, Heidelberg (1984)
Arita, S.: Algorithms for computations in Jacobian group of Cab curve and their application to discrete-log-based public key cryptosystems. In: Conference on The Mathematics of Public Key Cryptography, Toronto (1999)
Arita, S.: Gaudry’s variant against Cab curve. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 58–67. Springer, Heidelberg (2000)
Cremona, J.E.: Algorithms For Modular Elliptic Curves. Cambridge University Press, Cambridge (1997)
Frey, G., Rück, H.-G.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Mathematics of Computation 62, 865–874 (1994)
Frey, G., Müller, M.: Arithmetic of Modular Curves and Applications (1998) (preprint)
Gaudry, P.: A variant of the Adleman-DeMarris-Huang algorithm and its application to small genera. In: Conference on The Mathematics of Public Key Cryptography, Toronto (1999)
Grayson, D., Stillman, M.: Macaulay 2 – a system for computation in algebraic geometry and commutative algebra., http://math.uiuc.edu/Macaulay2
Miura, S.: Linear Codes on Affie Algebraic Curves. Trans. of IEICE vol. J81-A(10), 1398–1421 (1998)
Pollard, J.M.: Monte Carlo methods for index computation mod p,Math. Comp 32(143), 918–924 (1978)
Cornell, G., Silverman, J.H., Stevens, G. (eds.): Modular Forms and Fermat’s Last Theorem. Springer, Heidelberg (1997)
Rück, H.-G.: On the discrete logarithm in the divisor class group of curves. Math. Comp. 68(226), 805–806 (1999)
Shimura, M.: Defining Equations of Modular Curves X 0 (N), Tokyo. J. Math. 18(2), 443–456 (1995)
Wang, X.: 2-dimensional simple factors of J 0 (N). Manuscripta Math. 87, 179–197 (1995)
Weber, H.-J.: Hyperelliptic Simple Factors of J 0 (N)with Dimension at Least 3. Experimental Mathematics 6(4), 273–287 (1997)
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
Arita, S. (2000). Construction of Secure C ab Curves Using Modular Curves. In: Bosma, W. (eds) Algorithmic Number Theory. ANTS 2000. Lecture Notes in Computer Science, vol 1838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722028_5
Download citation
DOI: https://doi.org/10.1007/10722028_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67695-9
Online ISBN: 978-3-540-44994-2
eBook Packages: Springer Book Archive