Prefer a chat interface with context about you and your work?
Improved lower bound for Diffie–Hellman problem using multiplicative group of a finite field as auxiliary group
In 2004, Muzereau et al. showed how to use a reduction algorithm of the discrete logarithm problem to Diffie-Hellman 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 …