Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms (1994)

by Ueli M. Maurer
Citations:69 - 6 self

Documents Related by Co-Citation

2693 New Directions in Cryptography – Whitfield Diffie, Martin E. Hellman - 1976
74 Algorithms for black-box fields and their application to cryptography – D Boneh, R Lipton - 1996
2895 A Method for Obtaining Digital Signatures and Public-Key Cryptosystems – R.L. Rivest, A. Shamir, L. Adleman - 1978
34 Diffie-Hellman Oracles – Ueli M. Maurer, Stefan Wolf - 1996
301 An improved algorithm for computing logarithms over GF (p) and its cryptographic significance – G C Pohlig, M E Hellman - 1978
1109 A public key cryptosystem and a signature scheme based on discrete logarithms – T ElGamal - 1985
220 Lower Bounds for Discrete Logarithms and Related Problems – Victor Shoup - 1997
1172 Probabilistic encryption – S Goldwasser, S Micali - 1984
230 Monte Carlo Methods for Index Computation (mod p – J M Pollard - 1978
528 Uses of elliptic curves in cryptography – V Miller - 1985
136 An Efficient Off-line Electronic Cash System Based On The Representation Problem – Stefan Brands - 1993
356 A hard-core predicate for all one-way functions – Oded Goldreich, Leonid A. Levint - 1989
149 Number-theoretic constructions of efficient pseudo-random functions – Moni Naor, Omer Reingold - 1997
581 Efficient signature generation by smart cards – C P Schnorr - 1991
23 The discrete logarithm problem, Cryptology and Computational – K S McCurley - 1990
25 Diffie-Hellman is as strong as discrete log for certain primes – B den Boer - 1996
691 Elliptic curve cryptosystems – N Koblitz - 1987
233 Factoring integers with elliptic curves – H W Lenstra - 1987
54 A key distribution system equivalent to factoring – Kevin S McCurley - 1988