Abstract: Diffie-Hellman key exchange, also called exponential key exchange, is a method of digital encryption that uses numbers raised to specific powers to produce decryption keys on the basis of components that are never directly transmitted, making the task of a would-be code breaker mathematically overwhelming. The purpose of this paper is to propose an algorithm which is an improvement over the Diffie-Hellman key exchange. The algorithm is based on using arithmetic and logarithmic calculations for transmission of the shared session keys which enable users to securely exchange keys which further can be used for later encryptions. 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 its 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 algorithm uses simple arithmetic and logarithmic equations to generate and exchange keys over an insecure network.
Keywords: Key Exchange, Diffie-Hellman Protocol, Security, Time Complexity