New public-key schemes based on elliptic curves over the ring Zn

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 576 LNCS, Issue , 1992, Pages 252-266

  Koyama, Kenji ^a   Maurer, Ueli M ^b   Okamoto, Tatsuaki ^a   Vanstone, Scott A ^c  

^a NTT CORPORATION   (Japan)

^b PRINCETON UNIVERSITY   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; FUNCTIONS; PUBLIC KEY CRYPTOGRAPHY;

DIGITAL SIGNATURE SCHEMES; ELLIPTIC CURVE; PUBLIC KEY CRYPTOSYSTEMS; PUBLIC KEY SCHEMES; RING ZN; TRAPDOOR ONE WAY FUNCTION; ZERO KNOWLEDGE IDENTIFICATION;

GEOMETRY;

EID: 85029478766     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46766-1_20     Document Type: Conference Paper

References (25)

1. L. Adleman, K. Manders, and G. Miller, “On taking roots in finite fields”, 20th FOCS, Vol. 20, 1977, pp. 175-178 (1977).
2. D. Chaum, “Blind signatures for untraceable payments”, Proc. of Crypto’82, pp. 199-203 (1982).
3. W. Diffie and M.E. Hellman, “New directions in cryptography, IEEE Transactions on Information Theory,” Vol. 22, No. 6, pp. 644-654 (1976).
4. T. El-Gamal, “A public key cryptosystem and a signature scheme based on the discrete logarithm”, IEEE Transactions on Information Theory, Vol. 31, No. 4, pp. 469-472 (1985).
5. S. Goldwasser and J. Kilian, “Almost all primes can be quickly certified”, Proc. of the 18th Annual ACM Symposium on the Theory of Computing, pp. 316-329 (1986).
6. J. Hastad, “On using RSA with low exponent in a public key network”, Proc. of Crypto’85, pp. 403-408 (1985).
7. W. Jonge and D. Chaum, " Attacks on some RSA signatures”, Proc. of Crypto’85, pp. 18-27 (1985).
8. B.S. Kaliski, “A pseudo-random bit generator based on elliptic logarithms”, Proc. of Crypto’86, pp. 84-103 (1987).
9. N. Koblitz, A Course in Number Theory and Cryptography, Berlin: Springer-Verlag, (1987).
10. K. Koyama, “A Master Key for the RSA public-key cryptosystem”, I.E.C.E. Trans.(D), J-65, 2, pp. 163-170 (1982).
11. E. Kranakis, Primality and Cryptography, Stuttgart: Teubner, and New York: John Wiley & Sons, (1986).
12. A.K. Lenstra, H.W. Lenstra, M.S. Manasse and J.M. Pollard, “The number field sieve”, Proc. of STOC’90, pp. 564-572 (1990).
13. A.K. Lenstra and M.S. Manasse, “Factoring with two large primes”, Proc. of EUROCRYPT’90, pp. 72-82 (1991)
14. H.W. Lenstra, “Factoring integers with elliptic curves”, Annals of Mathematics, Vol. 126, pp. 649-673 (1987).
15. U.M. Maurer, “Fast generation of RSA-moduli with almost maximal diversity”, Proc. of EUROCRYPT’89, pp. 636-647 (1990).
16. U.M. Maurer and Y. Yacobi, “Non-interactive public-key cryptography”, to appear in Proc. Eurocrypt’ 91.
17. J.L. Massey, “Cryptography - fundamentals and applications (Copies of transparencies)", Advanced Technology Seminars, Zurich, Switzerland, (1988).
18. G.L. Miller, “Riemann’s hypothesis and tests for primality”, J. Comput. System Sci. Vol. 13, pp. 300-317, (1976).
19. A.J. Menezes, T. Okamoto, S.A. Vanstone, “Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field”, Proc. of STOC’91, pp. 80-89 (1991).
20. M.O. Rabin, “Probabilistic algorithm for testing primality”, Journal on Number Theory, Vol. 12, pp. 128-138 (1980).
21. R.L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems”, Communications of the ACM, Vol. 21, No. 2, pp. 120-126 (1978).
22. R. Schoof, “Elliptic curves over finite fields and the computation of square roots mod p”, Mathematics of Computation, Vol. 44, No. 170, pp. 483-494 (1985).
23. J.H. Silverman, The Arithmetic of Elliptic Curves, Springer-Verlag, (1986).
24. G. Simmons and M. Norris, “Preliminary comments on the M.I.T. public key cryptosystem”, Cryptologia, Vol. 1, No. 4, pp. 406-414 (1977).
25. J. Stein, “Computational problems associated with Racah algebra”, J. Comp. Phys., Vol. 1, pp. 397-405 (1961).