Cryptology ePrint Archive: Report 2004/306

The Static Diffie-Hellman Problem

Daniel R. L. Brown and Robert P. Gallant

Abstract: The static Diffie-Hellman problem (SDHP) is the special case of the classic Diffie-Hellman problem where one of the public keys is fixed. We establish that the SDHP is almost as hard as the associated discrete logarithm problem. We do this by giving a reduction that shows that if the SDHP can be solved then the associated private key can be found. The reduction also establishes that certain systems have less security than anticipated. The systems affected are based on static Diffie-Hellman key agreement and do not use a key derivation function. This includes some cryptographic protocols: basic ElGamal encryption; Chaum and van Antwerpen's undeniable signature scheme; and Ford and Kaliski's key retrieval scheme, which is currently being standardized in IEEE P1363.2.

Category / Keywords: public-key cryptography / Static Diffie-Hellman, ElGamal Encryption, Ford-Kaliski Key Retrieval, Provable Security

Publication Info: Submitted to Eurocrypt 2005 (preliminary version)

Date: received 15 Nov 2004, last revised 24 Jun 2005

Contact author: dbrown at certicom com

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation

Note: revisions in the interest of clarity

Version: 20050624:164831 (All versions of this report)

Short URL: ia.cr/2004/306

Discussion forum: Show discussion | Start new discussion