Security of most significant bits of \(g^{x^{2}}\).

DOI10.1016/S0020-0190(01)00315-5zbMath1043.94014OpenAlexW1964506805MaRDI QIDQ1853041

Igor E. Shparlinski

Publication date: 21 January 2003

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00315-5

zbMATH Keywords

exponential sumscryptographyhidden number problembit security

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

On the bit security of the weak Diffie-Hellman problem ⋮ Security of polynomial transformations of the Diffie-Hellman key. ⋮ On the complexity of the discrete logarithm and Diffie-Hellman problems

Cites Work

• The insecurity of the elliptic curve digital signature algorithm with partially known nonces
• On a New Exponential Sum
• 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
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
• Character sums with exponential functions
• A sieve algorithm for the shortest lattice vector problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Security of most significant bits of \(g^{x^{2}}\).