On Diffie-Hellman Key Agreement with Short Exponents

DOI10.1007/3-540-68339-9_29MaRDI QIDQ2876913zbMATH OpenOpenAlexFDO

Authors Michael J. Wiener, P. C. Van Oorschot

Publication date 20 August 2014

Published in Advances in Cryptology — EUROCRYPT ’96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-68339-9_29

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Public Key Cryptography – PKC 2004
• Short signatures from Diffie-Hellman: realizing almost compact public key
• On the bit security of the Diffie-Hellman key
• Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption
• scientific article; zbMATH DE number 1588479
• On the bit security of the weak Diffie-Hellman problem
• On the Bits of Elliptic Curve Diffie-Hellman Keys
• On an exponential sum related to the Diffie-Hellman cryptosystem
• scientific article; zbMATH DE number 1504546

Cited in

(24)

• Bootstrapping for approximate homomorphic encryption
• On the tightness of forward-secure signature reductions
• Computing low-weight discrete logarithms
• Non-uniform birthday problem revisited: refined analysis and applications to discrete logarithms
• Safety in numbers: on the need for robust Diffie-Hellman parameter validation
• Short signatures from Diffie-Hellman: realizing almost compact public key
• A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
• On reusing ephemeral keys in Diffie-Hellman key agreement protocols
• Some baby-step giant-step algorithms for the low Hamming weight discrete logarithm problem
• The discrete logarithm problem for exponents of bounded height
• Tightly secure signatures from lossy identification schemes
• Solving discrete logarithm problem in an interval using periodic iterates
• Security analysis of discrete logarithm based cryptosystems
• Computing discrete logarithms in an interval
• Tighter Reductions for Forward-Secure Signature Schemes
• Computing interval discrete logarithm problem with restricted jump method
• Progress in Cryptology - INDOCRYPT 2003
• An Efficient On-Line/Off-Line Signature Scheme without Random Oracles
• Topics in Cryptology – CT-RSA 2005
• Public Key Cryptography – PKC 2004
• \textit{Caveat implementor!} Key recovery attacks on MEGA
• Using equivalent class to solve interval discrete logarithm problem
• Security analysis of a password-based authentication protocol proposed to IEEE 1363
• Fast generators for the Diffie-Hellman key agreement protocol and malicious standards

This page was built for publication: On Diffie-Hellman Key Agreement with Short Exponents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2876913)