Relationships among the Computational Powers of Breaking Discrete Log Cryptosystems

This publication has 18 references indexed in Scilit:

• Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms
  Published by Springer Nature ,2001
• Non-Interactive Oblivious Transfer and Applications
  Published by Springer Nature ,2001
• Cheating at Mental Poker
  Published by Springer Nature ,2000
• Diffie-Hellman is as Strong as Discrete Log for Certain Primes
  Published by Springer Nature ,1990
• Limits on the provable consequences of one-way permutations
  Published by Association for Computing Machinery (ACM) ,1989
• Elliptic Curve Cryptosystems
  Mathematics of Computation, 1987
• A Course in Number Theory and Cryptography
  Published by Springer Nature ,1987
• Discrete logarithms inGF(p)
  Algorithmica, 1986
• A public key cryptosystem and a signature scheme based on discrete logarithms
  IEEE Transactions on Information Theory, 1985
• New directions in cryptography
  IEEE Transactions on Information Theory, 1976