Intractable problems in cryptography
Neal Koblitz and Alfred Menezes
Finite Fields: Theory and Applications, Contemporary Mathematics, 518 (2010), 279-300.
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.