Review of Diffie-Hellman and ElGamal Algorithms

Abstract

The Diffie-Hellman protocol and ElGamal encryption algorithm are relevant to modern cryptography – they allow for safe message communications in public key systems. The Diffie-Hellman protocol was proposed in 1976, which lets two parties communicate through an insecure channel while creating a shared secret key. The algorithm is strong because it is difficult to solve the discrete logarithm problem in a finite cyclic group.

The ElGamal algorithm utilizes the Diffie-Hellman technique to provide asymmetric encryption to guarantee confidentiality. A variety of methods are utilized in cryptographic protocols to ensure the functioning of systems.

This study aims to conduct a comprehensive survey of the two encryption algorithms (The Diffie-Hellman protocol and the ElGamal encryption algorithm) and compare them in terms of (Performance, Security, Encryption Cost, and Suitability). We explain some important properties of encryption algorithms, such as: encryption speed, security level, key exchange speed, computational cost, and Quantum Resistant. We reviewed previous research related to these two algorithms in the period from 2010 to 2024 to learn about the developments made to these two algorithms.