International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

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

Authors:
Neal Koblitz
Alfred Menezes
Download:
URL: http://eprint.iacr.org/2007/442
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2007-13722,
  title={Another Look at Non-Standard Discrete Log and Diffie-Hellman Problems},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography /},
  url={http://eprint.iacr.org/2007/442},
  note={ ajmeneze@uwaterloo.ca 13859 received 26 Nov 2007, last revised 12 Dec 2007},
  author={Neal Koblitz and Alfred Menezes},
  year=2007
}