Sciweavers

Share
EUROCRYPT
2006
Springer

Security Analysis of the Strong Diffie-Hellman Problem

11 years 2 months ago
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
Jung Hee Cheon
Added 22 Aug 2010
Updated 22 Aug 2010
Type Conference
Year 2006
Where EUROCRYPT
Authors Jung Hee Cheon
Comments (0)
books