Secure Key Exchange with Authentication using Enhanced Diffie-Hellman and RSA applying to SSL

Abstract

Protecting data over the internet is a paramount concern. Cryptography plays a significant role in cybersecurity. The Diffie Hellman (DH) and the RSA Algorithms are the basis of several security standards and services on the internet. If the security of both algorithms is compromised, such systems will collapse. In this proposal, the combined cryptography system aims to achieve a secret message exchange. The Diffie-Hellman (DH) algorithm is implemented in securing data on the internet. The DH uses a symmetric key algorithm for shared secret keys between parties over an unsecured channel. The DH vulnerabilities, it does not have an authentication mechanism to validate the key exchange values, including the primitive root, which is essential to secure the communication. In this paper, we proposed that Enhanced Diffie-Hellman (EDH) will not generate primitive root (g). Instead, it uses two prime numbers (P and Q) on both parties and performs pre-computation before both parties exchange key values. Another strength of the proposed algorithm, it provides authentication for better security—also, the integration of EDH and RSA algorithm to handle secure encryption and decryption of the data. The proposed algorithm is secure. It encrypts and decrypts the message with secretly generated sender key and receiver key, which is known to the sender and receiver implemented two-level security.