Towards the equivalence of breaking the diffie-hellman protocol and computing discrete logarithms

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

Volumn 839 LNCS, Issue , 1994, Pages 271-281

  Maurer, Ueli M ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CYCLIC GROUP; DIFFIE-HELLMAN PROTOCOL; DISCRETE LOGARITHMS; PRIME FACTORS; SHORT-INTERVAL; SIDE INFORMATION; SMOOTH NUMBERS;

CRYPTOGRAPHY;

EID: 84947597805     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48658-5_26     Document Type: Conference Paper

References (19)

1. L.M. Adleman and M.A. Huang, Primality testing and abelian varieties over finite fields, Lecture Notes in Mathematics, vol. 1512, Springer Verlag, 1992.
2. J. Buchmann and H.C. Williams, A key-exchange system based on imaginary quadratic fields, Journal of Cryptology, vol. 1, no. 2, pp. 107–118, 1988.
3. 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, 1983.
4. B. den Boer, Diffie-Hellman is as strong as discrete log for certain primes, Advances in Cryptology — CRYPTO’ 88, Lecture Notes in Computer Science, vol. 403, pp. 530–539, Berlin: Springer-Verlag, 1989.
5. W. Diffie and M.E. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, vol. 22, no. 6, pp. 644–654, 1976.
6. 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.
7. 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.
8. H.W. Lenstra Jr., Factoring integers with elliptic curves, Annals of ematics, vol. 126, pp. 649–673, 1987.
9. J.L. Massey, Advanced Technology Seminars Short Course Notes, Zurich, 1993, pp 6.66–6.68.
10. U.M. Maurer and Y. Yacobi, Non-interactive public-key cryptography, Advances in Cryptology — EUROCRYPT’ 91, Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 547, pp. 498–507, 1991.
11. K.S. McCurley, A key distribution system equivalent to factoring, Journal of Cryptology, vol. 1, no. 2, pp. 95–105.
12. K.S. McCurley, The discrete logarithm problem, in Cryptology and computational number theory, C. Pomerance (ed.), Proc. of Symp. in Applied., vol. 42, pp. 49–74, American ematical Society, 1990.
13. A. Menezes, Elliptic curve public key cryptosystems, Kluwer Academic Publishers, 1993.
14. R. Peralta, A simple and fast probabilistic algorithm for computing square roots modulo a prime number, IEEE Trans. on Information Theory, vol. 32, no. 6, pp. 846–847, 1986.
15. S.C. Pohlig and M.E. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Transactions on Information Theory, vol. 24, no. 1, pp. 106–110, 1978.
16. J.M. Pollard, Theorems on factorization and primality testing, Proceedings of the Cambridge Philosophical Society, vol. 76, pp. 521–528, 1974.
17. 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.
18. H. Rück, A note on elliptic curves over finite fields,. Comp., vol. 49, pp. 301–304, 1987.
19. C.P. Schnorr, Efficient identification and signatures for smart cards, Advances in Cryptology — CRYPTO’ 89, Lecture Notes in Computer Science, vol. 435, pp. 239–252, Berlin: Springer-Verlag, 1990.