Fast generators for the Diffie-Hellman key agreement protocol and malicious standards

DOI10.1016/J.IPL.2005.11.025MaRDI QIDQ845702zbMATH OpenOpenAlexFDO

Authors Boaz Tsaban

Publication date 29 January 2010

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

Full work available at URL https://doi.org/10.1016/j.ipl.2005.11.025

zbMATH Keywords

cryptographydiscrete logarithm problemtrapdoorDiffie-Hellman problemfast generators

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• On Diffie-Hellman Key Agreement with Short Exponents
• A generic variant of NIST'S KAS2 key agreement protocol
• scientific article; zbMATH DE number 4187705
• scientific article; zbMATH DE number 2080992
• Diffie-Hellman Oracles

Cites work

• scientific article; zbMATH DE number 1186931 (Why is no real title available?)
• scientific article; zbMATH DE number 1759335 (Why is no real title available?)
• A hidden number problem in small subgroups
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Generating ElGamal signatures without knowing the secret key
• New directions in cryptography
• Security proofs for signature schemes
• Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms

Cited in

(1)

• Safety in numbers: on the need for robust Diffie-Hellman parameter validation

This page was built for publication: Fast generators for the Diffie-Hellman key agreement protocol and malicious standards

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