The theoretical equivalence between the DLP and DHP problems was shown by Maurer in 1994. His work was then reexamined by Muzereau et al.  for the special case of elliptic curves used in practical cryptographic applications. This paper improves on the latter and tries to get the tightest possible reduction in terms of computational equivalence, using Maurer?s method.
|Translated title of the contribution||The Equivalence Between the DHP and DLP for Elliptic Curves Used in Practical Applications, Revisited|
|Title of host publication||Coding and Cryptography - IMACC 2005|
|Pages||376 - 391|
|Number of pages||15|
|Publication status||Published - Nov 2005|
|Name||Lecture Notes in Computer Science|
Conference Proceedings/Title of Journal: Cryptography and Coding, Springer LNCS 3796