The Diffie-Hellman protocol
From MaRDI portal
Publication:1976038
Recommendations
Cited in
(16)- Diffie-Hellman Oracles
- 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
- scientific article; zbMATH DE number 1947519 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 3887597 (Why is no real title available?)
- 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
- Batch Diffie-Hellman key agreement systems
- The Equivalence between the DHP and DLP for Elliptic Curves Used in Practical Applications
- The Diffie-Hellman problem and generalization of Verheul's theorem
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)