CryptoDB
Intractable Problems in Cryptography
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2010-23191, title={Intractable Problems in Cryptography}, booktitle={IACR Eprint archive}, keywords={}, url={http://eprint.iacr.org/2010/290}, note={This paper is an updated version of our paper with the same title in the Proceedings of the 9th International Conference on Finite Fields and Their Applications ajmeneze@uwaterloo.ca 14831 received 14 May 2010, last revised 9 Aug 2010}, author={Neal Koblitz and Alfred Menezes}, year=2010 }