Advertisement

Equivalence of counting the number of points on elliptic curve over the ring Zn and factoring n

  • Noboru Kunihiro
  • Kenji Koyama
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1403)

Abstract

For composite n, we prove that counting the number of points on elliptic curves over the ring Zn is randomly computationally equivalent to factoring n. That is, we prove that if we can count it, we can easily factor n. Furthermore, we also prove that if we can solve the elliptic curve discrete logarithm problem modulo n, we can easily factor n.

Keywords

Polynomial Time Prime Factor Elliptic Curve Elliptic Curf Zero Point 
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

  1. 1.
    E. Bach. Discrete logarithm and factoring. Technical Report UCB/CSD 84/186, Computer Science Division (EECS), University of California, Berkley, Calfornia, 1984.Google Scholar
  2. 2.
    L. Charlap, R. Coley and D. Robbins. Enumerate of rational points on elliptic curves over finite fields, preprint, 1991.Google Scholar
  3. 3.
    N. Demytko. A new elliptic curve based analogue of RSA. Proc. of EUROCRYPT'93, LNCS765: pp.40–49, 1994.MathSciNetGoogle Scholar
  4. 4.
    N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48: pp.203–209, 1987.zbMATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    K. Koyama, U. Mauer, T. Okamoto and S. Vanstone. New public-key schemes based on elliptic curves over the ring Zn. Proc. of CRYPT0'91, LNCS576: pp.345–357, 1992.Google Scholar
  6. 6.
    K. Koyama. Fast RSA-type scheme based on singular curves y2 + axy ≡ x3 (mod n). Proc. of EUROCRYPT'95, LNCS921: pp.329–340, 1995.MathSciNetGoogle Scholar
  7. 7.
    H. Lenstra. Factoring integer with elliptic curves. Ann. of Math., 126: pp.649–673, 1987.zbMATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    D. L. Long. Random equivalence of factorization and computation of orders. Technical Report 284, Princeton University, Department of Electrical Engineering and Computer Science, April 1981.Google Scholar
  9. 9.
    A. Menezes. Elliptic curve public key cryptosystems. Kluwer academic publishers, 1993.Google Scholar
  10. 10.
    G. L. Miller. Riemann's hypothesis and tests for primality. Journal of Computer and System Sciences, 13: pp.300–317, 1976.zbMATHMathSciNetGoogle Scholar
  11. 11.
    V. S. Miller. Use of elliptic curves in cryptography. Proc. of CRYPTO'85, LNCS218: pp.417–426, 1986.Google Scholar
  12. 12.
    P. Riebenboim. The little book of big primes. Springer-Verlag, 1991.Google Scholar
  13. 13.
    R. Schoof. Elliptic curve over finite fields and the computation of square roots mod p. Mathematics of Computation, 44: pp.483–494, 1985.zbMATHMathSciNetCrossRefGoogle Scholar
  14. 14.
    J. Silverman. The Arithmetic of Elliptic Curves. Springer-Verlag, New York, 1986. GTM 106.Google Scholar
  15. 15.
    H. Woll. Reductions among number theoretical problems. Information and Computation, 72: pp.167–179, 1987.zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Noboru Kunihiro
    • 1
  • Kenji Koyama
    • 1
  1. 1.NTT Communication Science LaboratoriesKyotoJapan

Personalised recommendations