Paper 2007/442

Another Look at Non-Standard Discrete Log and Diffie-Hellman Problems

Neal Koblitz and Alfred Menezes

Abstract

We examine several versions of the one-more-discrete-log and one-more-Diffie-Hellman problems. In attempting to evaluate their intractability, we find conflicting evidence of the relative hardness of the different problems. Much of this evidence comes from natural families of groups associated with curves of genus 2, 3, 4, 5, and 6. This leads to questions about how to interpret reductionist security arguments that rely on these non-standard problems.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Also available at http://anotherlook.ca
Contact author(s)
ajmeneze @ uwaterloo ca
History
2011-08-15: last of 7 revisions
2007-12-05: received
See all versions
Short URL
https://ia.cr/2007/442
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2007/442,
      author = {Neal Koblitz and Alfred Menezes},
      title = {Another Look at Non-Standard Discrete Log and Diffie-Hellman Problems},
      howpublished = {Cryptology ePrint Archive, Paper 2007/442},
      year = {2007},
      note = {\url{https://eprint.iacr.org/2007/442}},
      url = {https://eprint.iacr.org/2007/442}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.