Construction of Secure Cab Curves Using Modular Curves

  • Seigo Arita
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1838)


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.


Erential Form Algebraic Curve Hyperelliptic Curve Weierstrass Point Modular Curve 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arbarello, E., Cornalba, M., Griffiths, P.A., Harris, J.: Geometry of Algebraic Curves, vol. 1. Springer, Heidelberg (1984)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Cremona, J.E.: Algorithms For Modular Elliptic Curves. Cambridge University Press, Cambridge (1997)zbMATHGoogle Scholar
  5. 5.
    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)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Frey, G., Müller, M.: Arithmetic of Modular Curves and Applications (1998) (preprint)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Grayson, D., Stillman, M.: Macaulay 2 – a system for computation in algebraic geometry and commutative algebra.,
  9. 9.
    Miura, S.: Linear Codes on Affie Algebraic Curves. Trans. of IEICE vol. J81-A(10), 1398–1421 (1998)Google Scholar
  10. 10.
    Pollard, J.M.: Monte Carlo methods for index computation mod p,Math. Comp 32(143), 918–924 (1978)zbMATHMathSciNetGoogle Scholar
  11. 11.
    Cornell, G., Silverman, J.H., Stevens, G. (eds.): Modular Forms and Fermat’s Last Theorem. Springer, Heidelberg (1997)zbMATHGoogle Scholar
  12. 12.
    Rück, H.-G.: On the discrete logarithm in the divisor class group of curves. Math. Comp. 68(226), 805–806 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Shimura, M.: Defining Equations of Modular Curves X 0 (N), Tokyo. J. Math. 18(2), 443–456 (1995)zbMATHMathSciNetGoogle Scholar
  14. 14.
    Wang, X.: 2-dimensional simple factors of J 0 (N). Manuscripta Math. 87, 179–197 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Weber, H.-J.: Hyperelliptic Simple Factors of J 0 (N)with Dimension at Least 3. Experimental Mathematics 6(4), 273–287 (1997)zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Seigo Arita
    • 1
  1. 1.C&C Media Research Laboratories, NECKawasaki KanagawaJapan

Personalised recommendations