Security Analysis of the Strong Diffie-Hellman Problem

Let g be an element of prime order p in an abelian group and Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, we can compute the secret in O(log p

• Type: Conference
• Year: 2006
• Where: EUROCRYPT
• Authors: Jung Hee Cheon
• Keywords: Abelian Group, Cryptology, EUROCRYPT 2006, Positive Divisor, Prime Order