Intractable Problems in Cryptography

Neal Koblitz; Alfred Menezes

Paper 2010/290

Intractable Problems in Cryptography

Neal Koblitz and Alfred Menezes

Abstract

We examine several variants of the Diffie-Hellman and Discrete Log problems that are connected to the security of cryptographic protocols. We discuss the reductions that are known between them and the challenges in trying to assess the true level of difficulty of these problems, particularly if they are interactive or have complicated input.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Also available at http://anotherlook.ca
Contact author(s): ajmeneze @ uwaterloo ca
History: 2011-08-15: last of 2 revisions; 2010-05-17: received; See all versions
Short URL: https://ia.cr/2010/290
License: CC BY

BibTeX

@misc{cryptoeprint:2010/290,
      author = {Neal Koblitz and Alfred Menezes},
      title = {Intractable Problems in Cryptography},
      howpublished = {Cryptology ePrint Archive, Paper 2010/290},
      year = {2010},
      note = {\url{https://eprint.iacr.org/2010/290}},
      url = {https://eprint.iacr.org/2010/290}
}