Elliptic curve cryptosystems using curves of smooth order over the ring ℤn

IEEE Transactions on Information Theory

Volumn 43, Issue 4, 1997, Pages 1231-1237

  Vanstone, Scott A ^a   Zuccherato, Robert J ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Cryptography; Digital signatures; Discrete logs; Elliptic curves; Factoring; Public key

Indexed keywords

DATA PROCESSING; MATHEMATICAL MODELS; SECURITY OF DATA;

DIGITAL SIGNATURES; ELLIPTIC CURVES; PUBLIC KEY;

CRYPTOGRAPHY;

EID: 0031190749     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.605586     Document Type: Article

References (31)

1. A. O. L. Atkin, "The number of points on an elliptic curve modulo a prime," unpublished, 1991.
2. A. O. L. Atkin and F. Morain, "Elliptic curves and primality proving," Math. Comp., vol. 61, pp. 29-68, 1993.
3. E. Bach, "Explicit bounds for primality testing and related problems," Math. Comp., vol. 55, pp. 355-380, 1990.
4. E. R. Canfield, P. Erdös, and C. Pomerance, "On a problem of Oppenheim concerning 'Factorisatio Numerorum'," J. Number Theory, vol. 17, pp. 1-28, Aug. 1983.
5. H. Cohen, A Course in Computational Algebraic Number Theory. Berlin, Germany: Springer-Verlag, 1993.
6. 2: Fermat, Class Field Theory, and Complex Multiplication. New York: Wiley, 1989.
7. N. Demytko, "A new elliptic curve based analogue of RSA," in Advances in Cryptology - EUROCRYPT'93 (Lecture Notes in Computer Science, vol. 765). Berlin, Germany: Springer-Verlag, 1993, pp. 40-49.
8. W. Diffie and M. Hellman, "New directions in cryptography," IEEE Trans. Inform. Theory, vol. IT-22, pp. 644-654, 1976.
9. T. ElGamal, "A public key cryptosystem and a signature scheme based on discrete logarithms," IEEE Trans. Inform. Theory, vol. IT-31, pp. 469-472, 1985.
10. P. Erdös, "On the normal number of prime factors of p - 1 and some related problems concerning Euler's φ-function," Quart. J. Math. Oxford, vol. 6, pp. 205-213, 1935.
11. C. G. Günther, "An identity-based key exchange protocol," in Advances in Cryptology - EUROCRYPT'89 (Lecture Notes in Computer Science, vol. 434). Berlin, Germany:Springer-Verlag, 1989, pp. 29-37.
12. K. Ireland and Rosen, A Classical Introduction to Modern Number Theory. New York: Springer-Verlag, 1990.
13. D. E. Knuth and L. T. Pardo, "Analysis of a simple factorization algorithm," Theor. Comput. Sci., vol. 3, pp. 321-348, 1976.
14. N. Koblitz, "Elliptic curve cryptosystems," Math. Comp., vol. 48, pp. 203-209, 1987.
15. n," in Advances in Cryptology - CRYPTO'91 (Lecture Notes in Computer Science, vol. 576). Berlin, Germany: Springer-Verlag, 1991, pp. 252-266.
16. S. Lang, Elliptic Functions. New York: Springer-Verlag, 1987.
17. G. Lay and H. Zimmer, "Constructing elliptic curves with given group order over large finite fields," in Algorithmic Number Theory: First International Symposium (Lecture Notes in Computer Science, vol. 877). Berlin, Germay: Springer-Verlag, 1994, pp. 250-263.
18. H. W. Lenstra, Jr., "Factoring with elliptic curves," Ann. Math., vol. 126, pp. 649-673, 1987.
19. A. J. Menezes, Elliptic Curve Public Key Cryptosystems. Boston, MA: Kluwer, 1993.
20. U. M. Maurer, "On the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms," in Advances in Cryptology - CRYPTO'94 (Lecture Notes in Computer Science, vol. 839). Berlin, Germany: Springer-Verlag, 1994, pp. 271-281.
21. U. M. Maurer and Y. Yacobi, "Non-interactive public key cryptography," in Advances in Cryptology - EUROCRYPT'91 (Lecture Notes in Computer Science, vol. 547). Berlin, Germany: Springer-Verlag, 1991, pp. 498-507.
22. V. Miller, "Uses of elliptic curves in cryptography," in Advances in Cryptology - CRYPTO'85 (Lecture Notes in Computer Science, vol. 218). Berlin, Germany: Springer-Verlag, 1986, pp. 417-426.
23. A. Miyaji, "Elliptic curve cryptosystems immune to any reduction into the discrete logarithm problem," preprint.
24. National Bureau of Standards, "Data encryption standard," in Federal Information Processing Standard, U.S. Dept. Commerce, FIPS PUB 46, Washington, DC, 1977.
25. National Institute for Standards and Technology, "A proposed federal information processing standard for digital signature standard (DSS)," Tech. Rep. FIPS PUB XX, Draft, Aug. 1991.
26. S. Pohlig and M. Hellman, "An improved algorithm for computing logarithms over GF (p) and its cryptographic significance," IEEE Trans. Inform. Theory, vol. IT-24, pp. 106-110, 1978.
27. R. Rivest, A. Shamir, and L. Adleman, "A method for obtaining digital signatures and public-key cryptosystems," Commun. Assoc. Comput. Mach., vol. 21, pp. 120-126, 1978.
28. C. Schnorr, "Efficient signature generation by smart cards," J. Cryptol., vol. 4, pp. 161-174, 1991.
29. R. Schoof, "Elliptic curves over finite fields and the computation of square roots mod p," Math. Comp., vol. 44, pp. 483-494, 1985.
30. J. H. Silverman, The Arithmetic of Elliptic Curves. New York: Springer-Verlag, 1986.
31. S. A. Vanstone and R. J. Zuccherato, "Short RSA keys and their generation," J. Cryptol., vol. 8, pp. 101-114, 1995.