Improved Lower Bound on DHP: Towards the Equivalence of DHP and DLP for Important Elliptic Curves Used for Implementation

In 2004, Muzereau et al. showed how to use a reduction algorithm of the discrete logarithm problem to DiffieHellman problem in order to estimate lower bound on Diffie-Hellman problem on elliptic curves. They presented their estimates for various elliptic curves that are used in practical applications. In this paper, we show that a much tighter lower bound… CONTINUE READING