The Equivalence Between the DHP and DLP for Elliptic Curves Used in Practical Applications, Revisited

Kamel Bentahar

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

6 Citations (Scopus)

Abstract

The theoretical equivalence between the DLP and DHP problems was shown by Maurer in 1994. His work was then reexamined by Muzereau et al. [12] 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 contributionThe Equivalence Between the DHP and DLP for Elliptic Curves Used in Practical Applications, Revisited
Original languageEnglish
Title of host publicationCoding and Cryptography - IMACC 2005
PublisherSpringer
Pages376 - 391
Number of pages15
Volume3796
ISBN (Print)354030276X
Publication statusPublished - Nov 2005

Publication series

NameLecture Notes in Computer Science
PublisherSpringer

Bibliographical note

Conference Proceedings/Title of Journal: Cryptography and Coding, Springer LNCS 3796

Fingerprint Dive into the research topics of 'The Equivalence Between the DHP and DLP for Elliptic Curves Used in Practical Applications, Revisited'. Together they form a unique fingerprint.

  • Cite this

    Bentahar, K. (2005). The Equivalence Between the DHP and DLP for Elliptic Curves Used in Practical Applications, Revisited. In Coding and Cryptography - IMACC 2005 (Vol. 3796, pp. 376 - 391). (Lecture Notes in Computer Science). Springer. http://www.cs.bris.ac.uk/Publications/pub_info.jsp?id=2000413