Relationship between breaking the Diffie-Hellman protocol and computing discrete logarithms

SIAM Journal on Computing

Volumn 28, Issue 5, 1999, Pages 1689-1721

  Maurer, Ueli M ^a   Wolf, Stefan ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CRYPTOGRAPHY; NUMERICAL METHODS; POLYNOMIALS;

COMPUTING DISCRETE LOGARITHMS; DIFFIE-HELLMAN PROTOCOL; ELLIPTIC CURVES; MULTIPLE PRIME FACTORS;

COMPUTATION THEORY;

EID: 0032621240     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539796302749     Document Type: Article

References (49)

1. L. M. ADLEMAN AND M. A. HUANG, Primality Testing and Abelian Varieties over Finite Fields, Lecture Notes in Math. 1512, Springer-Verlag, New York, 1992.
2. E. BACH AND J. SHALLIT, Factoring with cyclotomic polynomials, Math. Comp., 52 (1989), pp. 201-219.
3. D. BONEH, Studies in computational number theory with applications to cryptography, Ph. D. Thesis, Princeton Univ., Princeton, NJ, 1996.
4. D. BONEH AND R. J. LIPTON, Algorithms for black-box fields and their application to cryptography, Advances in Cryptology - CRYPTO '96, Lecture Notes in Computer Science 1109, Springer-Verlag, 1996, pp. 283-297.
5. S. BRANDS, An Efficient Off-line Electronic Cash System Based on the Representation Problem, Tech. Rep. CS-R9323, CWI, Amsterdam, 1993.
6. J. BUCHMANN AND V. MÜLLER, Computing the number of points of elliptic curves over finite fields, Proceedings ISSAC '91, ACM Press, New York, 1991, pp. 179-182.
7. J. BUCHMANN AND H. C. WILLIAMS, A key-exchange system based on imaginary quadratic fields, J. Cryptology, 1 (1988), pp. 107-118.
8. E. R. CANFIELD, P. ERDÖS, AND C. POMERANCE, On a problem of Oppenheim concerning "Factorisatio Numerorum," J. Number Theory, 17 (1983), pp. 1-28.
9. D. G. CANTOR, Computing in the Jacobian of a hyperelliptic curve, Math. Comp., 48 (1987), pp. 95-101.
10. M. A. CHEREPNEV, On the connection between discrete logarithms and the Diffie-Hellman problem, Discrete Math. Appl., 1996.
11. D. COPPERSMITH AND I. E. SHPARLINSKY, On polynomial approximation and the parallel complexity of the discrete logarithm problem and breaking the Diffie-Hellman cryptosystera, preprint, Nov. 1996.
12. B. DEN BOER, Diffie-Hellman is as strong as discrete log for certain primes, Advances in Cryptology - CRYPTO '88, Lecture Notes in Comput. Sci. 403, Springer-Verlag, New York, 1989, pp. 530-539.
13. W. DIFFIE AND M. E. HELLMAN, New directions in cryptography, IEEE Trans. Inform. Theory, 22 (1976), pp. 644-654.
14. T. EL-GAMAL, A public key cryptosystem and a signature scheme based on the discrete logarithm, IEEE Trans. Inform. Theory, 31 (1985), pp. 469-472.
15. W. FELLER, An Introduction to Probability Theory and its Applications, John Wiley & Sons, 1968.
16. K. O. GEDDES, S. R. CZAPOR, AND G. LABHAN, Algorithms for Computer Algebra, Kluwer Academic Publisher, 1992.
17. S. GOLDWASSER AND J. KILIAN, Almost all primes can be quickly certified, Proceedings of the 18th Annual ACM Symposium on the Theory of Computing, 1986, pp. 316-329.
18. G. H. HARDY AND E. M. WRIGHT, An Introduction to the Theory of Numbers, Oxford University Press, Oxford, 1979.
19. K. IRELAND AND M. ROSEN, A Classical Introduction to Modern Number Theory, Springer-Verlag, New York, 1982.
20. N. KOBLITZ, Hyperelliptic cryptosystems, J. Cryptology, 1 (1989), pp. 139-150.
21. N. KOBLITZ, Elliptic curve cryptosystems, Math. Comp., 48 (1987), pp. 203-209.
22. G.-J. LAY AND II. G. ZIMMER, Constructing elliptic curves with given group order over large finite fields, in Proceedings of ANTS-I, Lecture Notes in Comput. Sci. 877, Springer-Verlag, New York, 1994, pp. 250-263.
23. H. W. LENSTRA, JR., Factoring integers with elliptic curves. Annals of Mathematics, 126 (1987), pp. 649-673.
24. R. LIDL AND H. NIEDERREITER, Introduction to Finite Fields and Their Application, Cambridge University Press, Cambridge, UK, 1986.
25. J. L. MASSEY, Advanced Technology Seminars Short Course Notes, Zürich, 1993, pp. 6.66-6.68.
26. U. M. MAURER, Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms, in Advances in Cryptology CRYPTO '94, Lecture Notes in Comput. Sci. 839, Springer-Verlag, New York, 1994, pp. 271-281.
27. U. M. MAURER AND S. WOLF, The Diffie Hellman protocol, in Des. Codes Cryptog., Special Issue "20 Years of Public-Key Cryptography," to appear.
28. U. M. MAURER AND S. WOLF, Lower Bounds on Generic Algorithms ni Groups, in Advances in Cryptology ENDOCRYPT '96, Lecture Notes in Comput. Sci. 1403, Springer-Verlag, New York, 1998, pp. 72-84.
29. U. M. MAURER AND S. WOLF, On the complexity of breaking the Diffie Hellman protocol, Tech. Rep. 244. Computer Science Department, ETH Zürich, Switzerland, 1996, pp. 27-29.
30. U. M. MAURER AND S. WOLF, Diffie Hellman oracles, in Advances in Cryptology CRYPTO '96, Lecture Notes in Comput. Sci. 1109. Springer-Verlag, New York, 1996, pp. 268-282.
31. U. M. MAURER AND Y. YACOBI, Non-interactive public-key cryptography, Des. Codes Cryptog., 9 (1996), pp. 305-316.
32. K. S. MCCURLEY, A key distribution system equivalent factoring, J. Cryptology, 1 (1988), pp. 95-105.
33. K. S. MCCURLEY, The discrete logarithm problem, in Cryptology and Computational Number Theory, Proc. Sympos. Appl. Math. 42, C. Pomerance, ed., American Mathematical Society, Providence, RI. 1990. pp. 49-74.
34. A. J. MENEZES, ed., Applications of Finite Fields, Kluwer Academic Publishers, Norwell, MA, 1992.
35. A. J. MENEZES, Elliptic Curve Public Key Cryptosystems, Kluwer Academic Publishers, Norwell, MA, 1993.
36. V. MILLER, Uses of elliptic curves in cryptography in Advances in Cryptology - CRYPTO '85, Lecture Notes in Comput. Sci 218. Springer-Verlag, New York, 1986, pp. 417-426.
37. S. C. POHLIG AND M. E. HELLMAN, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Trans. Inform. Theory, 24 (1978), pp. 106-110.
38. J. M. POLLARD, Monte-Carlo methods for under computation mod p. Math. Comp., 32 (1978), pp. 918-924.
39. J. M. POLLARD, Theorems on factorization and primality testing, Proceedings of the Cambridge Philosophical Society, 76 (1974), pp. 521-528.
40. R. L. RIVEST, A. SHAMIR, AND L. ADLEMAN, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, 21 (1978), pp. 120-126.
41. H. RÜCK, A note on elliptic elliptic curves over finite fields, Math. Comp., 49 (1987), pp. 301-304.
42. K. SAKURAI AND H. SHIZUYA, Relationships among the computational powers of breaking discrete log cryptosystem. Advances in Cryptology - EUROCRYPT '95, Lecture Notes in Comput. Sci. 921, Springer-Verlag, New York, 1995, pp. 341-355.
43. C. P. SCHINORR, Efficient identification and signatures for smart cards, in Advances in Cryptology CRYPTO '89, Lecture Notes in Comput. Sci. 435, Springer-Verlag, New York, 1990, pp. 239-252.
44. R. SCHOOF, Elliptic curves over finite fields and the computation of square roots mod p, Math. Comp., 44 (1985), pp. 183-494.
45. V. SHOUP, Lower bounds for discrete logarithms and related problems, in Advances in Cryptology EUROCRYPT '97, Lecture Notes in Comput. Sci. 1233, Springer-Verlag, New York, 1997, pp. 256-266.
46. I. E. SHPARLINSKY, Computational Problems in Finite Fields. Kluwer Academic Publishers, Norwell, MA, 1992.
47. n. IEEE Trans. Inform. Theory, 43 (1997), pp. 1231-1237.
48. S. WOLF, Diffie-Hellman and discrete logarithms. Diploma Thesis, Department of Computer Science, ETH Zürich, Zürich, Switzerland, 1995.
49. S. WOLF, Unconditionally and Computationally Secure Key Agreement in Cryptography, Ph.D. thesis, ETH Zürich, Zürich, Switzerland, 1999.