The Diffie-Hellman protocol
From MaRDI portal
Publication:1976038
DOI10.1023/A:1008302122286zbMATH Open0983.94037OpenAlexW2118893209WikidataQ57567972 ScholiaQ57567972MaRDI QIDQ1976038FDOQ1976038
Authors: S. 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
Recommendations
Cited In (16)
- A fusion algorithm for solving the hidden shift problem in finite abelian groups
- On relationship of computational Diffie-Hellman problem and computational square-root exponent problem
- Polynomial approximation of bilinear Diffie-Hellman maps
- Another look at non-standard discrete log and Diffie-Hellman problems
- Title not available (Why is that?)
- Improved lower bound for Diffie-Hellman problem using multiplicative group of a finite field as auxiliary group
- Cryptographic transformations of non-Shannon sources of information
- Title not available (Why is that?)
- Group key management based on semigroup actions
- On the complexity of the discrete logarithm and Diffie-Hellman problems
- Polynomial representations of the Diffie-Hellman mapping
- Delegation of cryptographic servers for capture-resilient devices
- The Equivalence between the DHP and DLP for Elliptic Curves Used in Practical Applications
- Batch Diffie-Hellman key agreement systems
- The Diffie-Hellman problem and generalization of Verheul's theorem
- Diffie-Hellman Oracles
This page was built for publication: The Diffie-Hellman protocol
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1976038)