The Diffie-Hellman protocol

DOI10.1023/A:1008302122286zbMath0983.94037OpenAlexW2118893209MaRDI QIDQ1976038

Stefan Wolf, Ueli M. Maurer

Publication date: 8 May 2000

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008302122286

zbMATH Keywords

securitydiscrete logarithm problemDiffie-Hellman protocolpublic-key cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (12)

Improved lower bound for Diffie-Hellman problem using multiplicative group of a finite field as auxiliary group ⋮ The Equivalence between the DHP and DLP for Elliptic Curves Used in Practical Applications ⋮ Polynomial approximation of bilinear Diffie-Hellman maps ⋮ Cryptographic transformations of non-Shannon sources of information ⋮ Delegation of cryptographic servers for capture-resilient devices ⋮ Polynomial representations of the Diffie-Hellman mapping ⋮ On Relationship of Computational Diffie-Hellman Problem and Computational Square-Root Exponent Problem ⋮ Another look at non-standard discrete log and Diffie-Hellman problems ⋮ The Diffie-Hellman problem and generalization of Verheul's theorem ⋮ Group key management based on semigroup actions ⋮ On the complexity of the discrete logarithm and Diffie-Hellman problems ⋮ A fusion algorithm for solving the hidden shift problem in finite abelian groups

This page was built for publication: The Diffie-Hellman protocol