Efficient Extended Diffie-Hellman Key Exchange Protocol
Arjun Singh Rawat, Maroti Deshmukh
Abstract
Arjun Singh Rawat, Maroti Deshmukh
Abstract
The multi party key exchange is a cryptographic method by which users exchange the shared secrets and generate a common key among themselves using some unique cryptographic algorithms. The cryptographic key exchange has the security threat while transmission over a network channel. Diffie-Hellman approach developed to overcome the problems related to key exchange. It completely changed the method of key exchange over a secured as well as an unsecured network. The algorithm is based on exponential modular calculations for exchanging of the shared secrets and generating common session key. The aim of this approach is for securely generating the common session key. This method dynamically and securely exchanges the keys between the group of members has been applied for group applications such as a distributed database, computing, and group calls. The major limitation of the Diffie-Hellman approach is that it is intensive in case of computation thus, increases the time complexity during the session key generation process. This can be a major problem in the key exchange among systems with a low configuration where a minor degradation in security is not a big problem. The proposed algorithm has similar steps to that of the Diffie-Hellman approach, and a new related scheme is used for sharing session key which overcome the time complexity. The proposed key exchange approach uses modular arithmetic equations to generate and exchange keys and is capable to transfer keys over an insecure network.
OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The multi party key exchange is a cryptographic method by which users exchange the shared secrets and generate a common key among themselves using some unique cryptographic algorithms. The cryptographic key exchange has the security threat while transmission over a network channel. Diffie-Hellman approach developed to overcome the problems related to key exchange. It completely changed the method of key exchange over a secured as well as an unsecured network. The algorithm is based on exponential modular calculations for exchanging of the shared secrets and generating common session key. The aim of this approach is for securely generating the common session key. This method dynamically and securely exchanges the keys between the group of members has been applied for group applications such as a distributed database, computing, and group calls. The major limitation of the Diffie-Hellman approach is that it is intensive in case of computation thus, increases the time complexity during the session key generation process. This can be a major problem in the key exchange among systems with a low configuration where a minor degradation in security is not a big problem. The proposed algorithm has similar steps to that of the Diffie-Hellman approach, and a new related scheme is used for sharing session key which overcome the time complexity. The proposed key exchange approach uses modular arithmetic equations to generate and exchange keys and is capable to transfer keys over an insecure network.
Key concepts: Key exchange, Computer science, Diffie–Hellman key exchange, Shared secret, Key (lock), Session key, Cryptography, Pre-shared key