Cryptology ePrint Archive: Report 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.

Category / Keywords:

Publication Info: Also available at http://anotherlook.ca

Date: received 14 May 2010, last revised 15 Aug 2011

Contact author: ajmeneze at uwaterloo ca

Available formats: PDF | BibTeX Citation

Version: 20110815:115131 (All versions of this report)

Discussion forum: Show discussion | Start new discussion