Diffie-Hellman Oracles

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

Volumn 1109, Issue , 1996, Pages 268-282

  Maurer, Ueli M ^a   Wolf, Stefan ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

DifTie hellman protocol; Disrrete logarithms; Elliptic curves; Public key cryptography

Indexed keywords

POLYNOMIAL APPROXIMATION;

CYCLIC GROUP; DIFFIE HELLMAN; DIFFIE-HELLMAN PROTOCOL; DISCRETE LOGARITHMS; DISRRETE LOGARITHMS; EFFICIENT CONSTRUCTION; ELLIPTIC CURVE; POLYNOMIAL-TIME;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84955567079     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68697-5_21     Document Type: Conference Paper

References (21)

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. E. Bach and J. Shallit, Factoring with cyclotomic polynomials, Math. Comp., vol. 52, pp. 201-219, 1989.
3. D. Boneh and R.J. Lipton, Algorithms for black-box fields and their application to cryptography, preprint, 1995.
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, 1983.
5. 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.
6. W. Diffie and M.E. Heilman, New directions in cryptography, IEEE Transactions on Information Theory, vol. 22, no. 6, pp. 644-654, 1976.
7. K.O. Geddes, S.R. Czapor and G. Labhan, Algorithms for computer algebra, Kluwer Academic Publisher, 1992.
8. K. Ireland and M. Rosen, A classical introduction to modern number theory, Springer-Verlag, 1982.
9. N. Koblitz, Elliptic curve cryptosystems, Math. Comp., vol. 48, pp. 203-209, 1987.
10. G.-J. Lay and H.G. Zimmer, Constructing elliptic curves with given group order over large finite fields, preprint, 1994.
11. H.W. Lenstra, Jr., Factoring integers with elliptic curves, Annals of Mathematics, vol. 126, pp. 649-673, 1987.
12. J.L. Massey, Advanced Technology Seminars Short Course Notes, pp. 6.66-6.68, Zürich, 1993.
13. U.M. Maurer, Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms, Advances in Cryptology - CRYPTO '94, Y. Desmedt (ed.), Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 839, pp. 271-281, 1994.
14. U.M. Maurer and S. Wolf, On the complexity of breaking the Diffie-Hellman protocol, Tech. Rep. 244, Computer Science Department, ETH Zürich, April 1996. (Accessible at http://www.inf.ethz.ch/publications/isc.html)
15. K.S. McCurley, The discrete logarithm problem, in Cryptology and computational number theory, C. Pomerance (ed.), Proc. of Symp. in Applied Math., vol. 42, pp. 49-74, American Mathematical Society, 1990.
16. A.J. Menezes (ed.), Applications of finite fields, Kluwer Academic Publishers, 1992.
17. V. Miller, Uses of elliptic curves in cryptography, Advances in Cryptology - CRYPTO '85, Lecture Notes in Computer Science, Springer-Verlag, vol. 218, pp. 417-426, 1986.
18. S.C. Pohlig and M.E. Heilman, 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.
19. R. Schoof, Elliptic curves over finite fields and the computation of square roots mod p, Math. Comp., vol. 44, No. 170, pp. 483-494, 1985.
20. n, Preliminary version, 1994.
21. S. Wolf, Diffie-Hellman and discrete logarithms, Thesis, March 1995.