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

Research output: Chapter in Book/Report/Conference proceedingConference 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.

Original languageEnglish
Title of host publicationCryptography and Coding 2005
Subtitle of host publicationCryptography and Coding
EditorsNigel P. Smart
PublisherSpringer
Pages376-391
Number of pages16
Volume3796 LNCS
ISBN (Electronic)978-3-540-32418-8
ISBN (Print)354030276X, 978-3-540-30276-6
DOIs
Publication statusPublished - 2005
Externally publishedYes
Event10th IMA International Conference on Cryptography and Coding - Cirencester, United Kingdom
Duration: 19 Dec 200521 Dec 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3796 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Conference

Conference10th IMA International Conference on Cryptography and Coding
CountryUnited Kingdom
CityCirencester
Period19/12/0521/12/05

Fingerprint

Elliptic Curves
Equivalence

Keywords

  • DHP-DLP equivalence
  • Elliptic Curve Cryptosystems

ASJC Scopus subject areas

  • Biochemistry, Genetics and Molecular Biology(all)
  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Bentahar, K. (2005). The equivalence between the DHP and DLP for elliptic curves used in practical applications, revisited. In N. P. Smart (Ed.), Cryptography and Coding 2005: Cryptography and Coding (Vol. 3796 LNCS, pp. 376-391). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3796 LNCS). Springer. https://doi.org/10.1007/11586821_25

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

Cryptography and Coding 2005: Cryptography and Coding. ed. / Nigel P. Smart. Vol. 3796 LNCS Springer, 2005. p. 376-391 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3796 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference proceeding

Bentahar, K 2005, The equivalence between the DHP and DLP for elliptic curves used in practical applications, revisited. in NP Smart (ed.), Cryptography and Coding 2005: Cryptography and Coding. vol. 3796 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3796 LNCS, Springer, pp. 376-391, 10th IMA International Conference on Cryptography and Coding, Cirencester, United Kingdom, 19/12/05. https://doi.org/10.1007/11586821_25
Bentahar K. The equivalence between the DHP and DLP for elliptic curves used in practical applications, revisited. In Smart NP, editor, Cryptography and Coding 2005: Cryptography and Coding. Vol. 3796 LNCS. Springer. 2005. p. 376-391. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11586821_25
Bentahar, K. / The equivalence between the DHP and DLP for elliptic curves used in practical applications, revisited. Cryptography and Coding 2005: Cryptography and Coding. editor / Nigel P. Smart. Vol. 3796 LNCS Springer, 2005. pp. 376-391 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{b06823479f7544b8a76f1fba07f98aad,
title = "The equivalence between the DHP and DLP for elliptic curves used in practical applications, revisited",
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.",
keywords = "DHP-DLP equivalence, Elliptic Curve Cryptosystems",
author = "K. Bentahar",
year = "2005",
doi = "10.1007/11586821_25",
language = "English",
isbn = "354030276X",
volume = "3796 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "376--391",
editor = "Smart, {Nigel P.}",
booktitle = "Cryptography and Coding 2005",

}

TY - GEN

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

AU - Bentahar, K.

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

KW - DHP-DLP equivalence

KW - Elliptic Curve Cryptosystems

UR - http://www.scopus.com/inward/record.url?scp=33646853191&partnerID=8YFLogxK

U2 - 10.1007/11586821_25

DO - 10.1007/11586821_25

M3 - Conference proceeding

SN - 354030276X

SN - 978-3-540-30276-6

VL - 3796 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 376

EP - 391

BT - Cryptography and Coding 2005

A2 - Smart, Nigel P.

PB - Springer

ER -