Computer Science – Cryptography and Security
Scientific paper
2005-05-30
Information Processing Letters 99 (2006), 145--148
Computer Science
Cryptography and Security
Small updates
Scientific paper
10.1016/j.ipl.2005.11.025
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.
No associations
LandOfFree
Fast generators for the Diffie-Hellman key agreement protocol and malicious standards does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Fast generators for the Diffie-Hellman key agreement protocol and malicious standards, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast generators for the Diffie-Hellman key agreement protocol and malicious standards will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-314745