On the bit security of the Diffie-Hellman key

DOI10.1007/s00200-005-0184-xzbMath1098.94021MaRDI QIDQ2502165

Igor E. Shparlinski, Ian F. Blake, Theo Garefalakis

Publication date: 12 September 2006

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-005-0184-x

zbMATH Keywords

Exponential sums; Diffie-Hellman protocol; Bit security

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A60: Cryptography

20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)

14G50: Applications to coding theory and cryptography of arithmetic geometry

Cites Work

• Estimates for the number of sums and products and for exponential sums over subgroups in fields of prime order.
• Security of polynomial transformations of the Diffie-Hellman key.
• On the complexity of the discrete logarithm and Diffie-Hellman problems
• Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
• Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
• New bounds for Gauss sums derived from KTH powers, and for Heilbronn's exponential sum
• A hidden number problem in small subgroups
• Public Key Cryptography – PKC 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item