Secure Key Exchange Against Man-in-the-Middle Attack: Modified Diffie-Hellman Protocol

One of the most famous key exchange protocols is Diffie-Hellman Protocol (DHP) which is a widely used technique on which key exchange systems around the world depend. This protocol is simple and uncomplicated, and its robustness is based on the Discrete Logarithm Problem (DLP). Despite this, he is considered weak against the man-in-the-middle attack. This article presents a completely different version of the DHP protocol. The proposed version is based on two verification stages. In the first step, we check if the pseudo-random value α that Alice sends to Bob has been manipulated! In the second step, we make sure that the random value β that Bob sends to Alice is not manipulated. The man-in-the-middle attacker Eve can impersonate neither Alice nor Bob, manipulate their exchanged values, or discover the secret encryption key.

• Diffie-Hellman key exchange
• man-in-the-middle attacks
• key exchange
• discrete logarithm problem
• authentication
• message verification
• secure key exchange

• Advanced Authentication Protocols Security
• Cryptography and Data Security
• Cryptography and Residue Arithmetic
• Diffie-Hellman key exchange
• man-in-the-middle attacks
• key exchange
• discrete logarithm problem
• authentication
• message verification
• secure key exchange
• Computer Networks and Communications
• Artificial Intelligence
• Information Systems
• Computer Science