Security of polynomial transformations of the Diffie-Hellman key.

DOI10.1016/S1071-5797(03)00048-0zbMath1034.94007MaRDI QIDQ1418189

Igor E. Shparlinski

Publication date: 19 January 2004

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (3)

The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups ⋮ On the bit security of the Diffie-Hellman key ⋮ Bit Security of the CDH Problems over Finite Fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the correlation of binary \(M\)-sequences
• Security of most significant bits of \(g^{x^{2}}\).
• Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
• 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
• On the Bit Security of NTRUEncrypt
• Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation
• On the statistical properties of Diffie-Hellman distributions

This page was built for publication: Security of polynomial transformations of the Diffie-Hellman key.