Improving the Diffie-Hellman Key Exchange Algorithm by Proposing the Multiplicative Key Exchange Algorithm

Abstract

Exchanging cryptographic keys has been a problem with respect to security. Whitfield Diffie and Martin Hellman proposed the Diffie-Hellman key exchange algorithm to overcome the problem. Since then, the concept of key exchange over an unsecured network has completely been revolutionized. The algorithm is based on using arithmetic calculations for transmission of the shared session keys. The purpose of this algorithm is to enable users to securely exchange keys which can be used for later encryptions. This ability to securely exchange session keys dynamically and publicly between a group of users has become the foundation for secure group applications such as distributed computing, distributed databases and conference calls. Man-in-the-middle attacks are better secured using the Diffie-Hellman algorithm. Over time, Diffie-Hellman algorithm has been altered several times by various authors. However, some limitations to the Diffie-Hellman algorithm still persist. One of the limitations of the Diffie-Hellman algorithm is that it is computationally intensive thereby increasing the time complexity when generating public keys. The proposed algorithm has similar grounds with the Diffie-Hellman algorithm, and a new technique is used for sharing session keys which overcome the time complexity limitation of the Diffie-Hellman algorithm. The proposed "Multiplicative Key Exchange Algorithm" uses simple arithmetic equations to generate and exchange keys over an insecure network.

Performance Analysis of Two Famous Cryptographic Algorithms on Mixed Data

“…ElGamal algorithm outperformed the RSA algorithm during the decryption time of all categories of data. This is consistent with the existing pieces of literature (Boni et al, 2015;Thu et al, 2019;Parenreng and Wahid, 2022;Meshram et al, 2021;AbdulRaheem et al, 2021c). It was observed that the RSA algorithm generated large files and consumed more space (memory) during the encryption process of all categories of text, audio, image, and video data concerning the CPU's internal memory usage.…”

“…RSA has spent the most time in cryptography and the highest memory capacity. In another study (Boni et al, 2015), the authors suggested a novel methodology to enhance the Diffie-Hellman algorithm, thereby involving complicated calculations that increase the computational complexity when producing shared keys called the multipliers key exchange technique. They reported that the multiplicative key exchange is better than the Diffie-Hellman algorithm in terms of execution time, thus, needs few computations compared with the Diffie-Hellman algorithm.…”

Analysis Review on Public Key Cryptography Algorithms

“…Even the scheme is secure and fast, however, it was difficult to reverse the encryption process. Many researchers had improvised the original Diffie-Hellman to increase speed of key generation and to generate and exchange keys over an insecure network scheme by using simple arithmetic equations [7]. There are also schemes proposed to improvise the security of Diffie-Hellman cryptosystem by reducing possibility of a known plaintext attacks [8][9] and man-in-the-middle attacks [10][11].…”