The equivalence between the DHP and DLP for elliptic curves used in practical applications, revisited

Authors:
K. Bentahar
Affiliations:
Dept. Computer Science, University of Bristol, Bristol, United Kingdom
Venue:
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Year:
2005

Citing 7
Cited 0

A course in computational algebraic number theory

A course in computational algebraic number theory
The Diffie–Hellman Protocol

Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Elliptic curves in cryptography

Elliptic curves in cryptography
The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms

SIAM Journal on Computing
Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Algorithms

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Diffie-Hellman Oracles

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Guide to Elliptic Curve Cryptography

Guide to Elliptic Curve Cryptography

Quantified Score

Hi-index	0.00

Visualization

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.