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

DOI10.1016/j.ipl.2005.11.025zbMath1184.94261OpenAlexW2158179513MaRDI QIDQ845702

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)

Cites Work

• Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
• Generating EIGamal Signatures Without Knowing the Secret Key
• Security Proofs for Signature Schemes
• New directions in cryptography
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
• A hidden number problem in small subgroups
• Unnamed Item
• Unnamed Item

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