Enhanced n-party Diffie Hellman key exchange algorithm using the divide and conquer algorithm

Abstract

Cryptographic algorithms guarantee data and information security via a communication system against unauthorized users or intruders. Numerous encryption techniques have been employed to safeguard this data and information from hackers. By supplying a distinct shared secret key, the n-party Diffie Hellman key exchange approach has been used to protect data from hackers. Using a quadratic time complexity, the n-party Diffie-Hellman method is slow when multiple users use the cryptographic key interchange system. To solve this issue, the researchers created an effective shared hidden key for the n-party Diffie Hellman key exchange of a cryptographic system using the divide-and-conquer strategy. The current research recommends the use of the divide and conquer algorithm, which breaks down the main problem into smaller subproblems until it reaches the base solution, which is then merged to generate the solution of the main problem. The comparative analysis indicates that the developed system generates a shared secret key faster than the current n-party Diffie Hellman system.