On the security of Diffie-Hellman bits
From MaRDI portal
Recommendations
Cited in
(24)- Security of polynomial transformations of the Diffie-Hellman key.
- On the bit security of cryptographic primitives
- On the complexity of the discrete logarithm and Diffie-Hellman problems
- Security of most significant bits of \(g^{x^{2}}\).
- Cryptanalysis of elliptic curve hidden number problem from PKC 2017
- On the bit security of the Diffie-Hellman key
- Security of the most significant bits of the Shamir message passing scheme
- On Diffie-Hellman Key Agreement with Short Exponents
- scientific article; zbMATH DE number 5666449 (Why is no real title available?)
- Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
- Diffie-Hellman Oracles
- Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes
- Security Analysis of the Strong Diffie-Hellman Problem
- On the bit security of the weak Diffie-Hellman problem
- On the Bit Security of NTRUEncrypt
- Communication complexity and Fourier coefficients of the Diffie-Hellman key
- Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation
- Bounds of Gauss sums in finite fields
- The geometry of provable security: some proofs of security in which lattices make a surprise appearance
- A hidden number problem in small subgroups
- On the bit security of elliptic curve Diffie-Hellman
- Public Key Cryptography – PKC 2004
- Public Key Cryptography – PKC 2004
- The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups
This page was built for publication: On the security of Diffie-Hellman bits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2708626)
