Welcome to the resource topic for 2010/290
Title:
Intractable Problems in Cryptography
Authors: Neal Koblitz, 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.
ePrint: https://eprint.iacr.org/2010/290
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .