Intractable problems in cryptography
Neal Koblitz, Alfred Menezes · Contemporary mathematics - American Mathematical Society · 2010
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. 1.