On the bit security of the weak Diffie-Hellman problem

DOI10.1016/J.IPL.2010.07.001zbMATH Open1234.94064DBLPjournals/ipl/RohH10OpenAlexW2092834098WikidataQ62042668 ScholiaQ62042668MaRDI QIDQ407550FDOQ407550

Authors: Dongyoung Roh, Sang Geun Hahn 

Publication date: 27 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.07.001

Recommendations

• Security of most significant bits of \(g^{x^{2}}\).
• scientific article; zbMATH DE number 1588479
• Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
• A hidden number problem in small subgroups
• On the bit security of the Diffie-Hellman key

zbMATH Keywords

cryptographyhidden number problemweak Diffie-Hellman problem

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Sequences, discrepancies and applications
• Title not available (Why is that?)
• Advances in Cryptology - EUROCRYPT 2004
• Title not available (Why is that?)
• Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
• Advances in Cryptology - EUROCRYPT 2004
• The insecurity of the digital signature algorithm with partially known nonces
• Character sums with exponential functions
• Security of most significant bits of \(g^{x^{2}}\).
• Title not available (Why is that?)
• Security of the most significant bits of the Shamir message passing scheme
• A hidden number problem in small subgroups

Cited In (20)

• On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
• On Diffie-Hellman Key Agreement with Short Exponents
• Title not available (Why is that?)
• Security of Encryption Schemes in Weakened Random Oracle Models
• Title not available (Why is that?)
• Seeing opportunity in every difficulty: protecting information with weak value techniques
• Security Analysis of the Strong Diffie-Hellman Problem
• Title not available (Why is that?)
• Public Key Cryptography – PKC 2004
• RSA and Elliptic Curve Least Significant Bit Security
• Title not available (Why is that?)
• Topics in Cryptology – CT-RSA 2004
• On the bit security of cryptographic primitives
• On the weak keys of blowfish
• On the Impossibility of Private Key Cryptography with Weakly Random Keys
• Security of the most significant bits of the Shamir message passing scheme
• Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes
• Bit Security of the CDH Problems over Finite Fields
• Title not available (Why is that?)
• Weakness of $\mathbb{F}_{3^{6 \cdot 509}}$ for Discrete Logarithm Cryptography

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)