On the bit security of the weak Diffie-Hellman problem
From MaRDI portal
(Redirected from Publication:407550)
Recommendations
Cites work
- scientific article; zbMATH DE number 1588479 (Why is no real title available?)
- scientific article; zbMATH DE number 1339097 (Why is no real title available?)
- scientific article; zbMATH DE number 3091928 (Why is no real title available?)
- A hidden number problem in small subgroups
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Character sums with exponential functions
- Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
- Security of most significant bits of \(g^{x^{2}}\).
- Security of the most significant bits of the Shamir message passing scheme
- Sequences, discrepancies and applications
- The insecurity of the digital signature algorithm with partially known nonces
Cited in
(21)- Security of Encryption Schemes in Weakened Random Oracle Models
- On the bit security of cryptographic primitives
- RSA and elliptic curve least significant bit security
- scientific article; zbMATH DE number 1942436 (Why is no real title available?)
- On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
- Weakness of $\mathbb{F}_{3^{6 \cdot 509}}$ for Discrete Logarithm Cryptography
- Seeing opportunity in every difficulty: protecting information with weak value techniques
- On the weak keys of blowfish
- Security Analysis of the Strong Diffie-Hellman Problem
- scientific article; zbMATH DE number 5666449 (Why is no real title available?)
- Public Key Cryptography – PKC 2004
- On Diffie-Hellman Key Agreement with Short Exponents
- Topics in Cryptology – CT-RSA 2004
- scientific article; zbMATH DE number 1588479 (Why is no real title available?)
- Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes
- Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
- On the Impossibility of Private Key Cryptography with Weakly Random Keys
- scientific article; zbMATH DE number 6450652 (Why is no real title available?)
- scientific article; zbMATH DE number 1107699 (Why is no real title available?)
- Security of the most significant bits of the Shamir message passing scheme
- Bit Security of the CDH Problems over Finite Fields
This page was built for publication: On the bit security of the weak Diffie-Hellman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q407550)
