SPDH – A Secure Plain Diffie–Hellman Algorithm

Research output: Contribution to journalJournal articleResearchpeer-review

753 Downloads (Pure)


Secure communication in a wireless system or end-to-end communication requires setup of a shared secret. This shared secret can be obtained by the use of a public key cryptography system. The most widely used algorithm to obtain a shared secret is the Diffie–Hellman algorithm. However, this algorithm suffers from the Man-in-the-Middle problem; an attacker can perform an eavesdropping attack listen to the communication between participants A and B. Other algorithms as for instance ECMQV (Elliptic Curve Menezes Qo Vanstone) can handle this problem but is far more complex and slower because the algorithm is a three-pass algorithm whereas the Diffie–Hellman algorithm is a simple two-pass algorithm. Using standard cryptographic modules as AES and HMAC the purposed algorithm, Secure Plain Diffie–Hellman Algorithm, solves the Man-in-the-Middle problem and maintain its advantage from the plain Diffie–Hellman algorithm. Also the possibilities of replay attacks are solved by use of a timestamp.
Original languageEnglish
JournalJournal of Cyber Security and Mobility
Issue number2-3
Number of pages18
Publication statusPublished - 2012
Externally publishedYes


Dive into the research topics of 'SPDH – A Secure Plain Diffie–Hellman Algorithm'. Together they form a unique fingerprint.

Cite this