Skip to content
BY-NC-ND 3.0 license Open Access Published by De Gruyter February 4, 2009

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.

Received: 2007-11-26
Revised: 2008-04-15
Published Online: 2009-02-04
Published in Print: 2008-December

© de Gruyter 2008

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Downloaded on 30.11.2022 from frontend.live.degruyter.dgbricks.com/document/doi/10.1515/JMC.2008.014/html
Scroll Up Arrow