Extended Diffie-Hellman Algorithm for Key Exchange and Management
Akhil Kaushik · International Journal of Advances in Engineering Sciences (RG Journals of Scientific Research) · 2013
Abstract — Since the publication of Diffie-Hellman algorithm for two-party key exchange in 1976, the concept of key exchange over the insecure communication channel has revolutionized totally. The purpose of algorithm is used to enable users to security exchange a key that can be used for subsequent encryption. The ability to dynamically and publicly establish a session key for secure communication between groups of participants is a foundation of many secure group applications, such as conference calls, distributed computation, and distributed databases. The very idea is based on using arithmetic calculations to transmit the shared session keys using a cost-effective and easy mechanism. The Diffie-Hellman algorithm provides better security against attacks like man-in-the-middle attacks. Due to such superior features Diffie-Hellman algorithm has been revised many times by several authors. Our proposed algorithm is also based on Diffie-Hellman algorithm, which uses a new technique for sharing session keys. The proposed “Extended Diffie-Hellman Algorithm ” uses a digital image to produce random numbers for exchanging keys over insecure network.