On the bit security of the weak Diffie-Hellman problem

DOI10.1016/j.ipl.2010.07.001zbMath1234.94064OpenAlexW2092834098WikidataQ62042668 ScholiaQ62042668MaRDI QIDQ407550

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

zbMATH Keywords

cryptographyhidden number problemweak Diffie-Hellman problem

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

RSA and Elliptic Curve Least Significant Bit Security

Cites Work

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

This page was built for publication: On the bit security of the weak Diffie-Hellman problem