Fast generators for the Diffie-Hellman key agreement protocol and malicious standards
<|reference_start|>Fast generators for the Diffie-Hellman key agreement protocol and malicious standards: 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.<|reference_end|>
@article{tsaban2005fast,
    title={Fast generators for the Diffie-Hellman key agreement protocol and
  malicious standards},
    author={Boaz Tsaban},
    journal={Information Processing Letters 99 (2006), 145--148},
    year={2005},
    doi={10.1016/j.ipl.2005.11.025},
    archivePrefix={arXiv},
    eprint={cs/0505082},
    primaryClass={cs.CR cs.CC}
}