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

Authors:
Boaz Tsaban
Affiliations:
Department of Mathematics, The Weizmann Institute of Science, Rehovot, Israel
Venue:
Information Processing Letters
Year:
2006

Citing 6
Cited 0

The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms

SIAM Journal on Computing
The Validation of Cryptographic Algorithms

ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
The Decision Diffie-Hellman Problem

ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Appraising two decades of distributed computing theory research

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Generating EIGamal signatures without knowing the secret key

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Security proofs for signature schemes

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.89

Visualization

Abstract

The Diffie-Hellman key agreement protocol is based on taking large powers of a generator of a prime-order cyclic group. Some generators allow faster exponentiation. We show that to a large extent, using the fast generators is as secure as using a randomly chosen generator. On the other hand, we show that if there is some case in which fast generators are less secure, then this could be used by a malicious authority to generate a standard for the Diffie-Hellman key agreement protocol which has a hidden trapdoor.