Enhanced diffie-hellman algorithm for reliable key exchange

14th International Conference on Science, Engineering and Technology

自然科学;工业技术

Aryan^1 ; Kumar, Chaithanya^1 ; Durai Raj Vincent, P.M.^1

School of Information Technology and Engineering, VIT University, Vellore

Tamil Nadu

632014, India^1

关键词: Cryptographic key;    Insider attack;    Internet services;    Man in the middle attacks;    Primitive roots;    Public channels;    Public key cryptosystems;    Sender and receivers;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/263/4/042015/pdf
DOI  :  10.1088/1757-899X/263/4/042015

来源: IOP

【 摘 要 】

The Diffie -Hellman is one of the first public-key procedure and is a certain way of exchanging the cryptographic keys securely. This concept was introduced by Ralph Markel and it is named after Whitfield Diffie and Martin Hellman. Sender and Receiver make a common secret key in Diffie-Hellman algorithm and then they start communicating with each other over the public channel which is known to everyone. A number of internet services are secured by Diffie -Hellman. In Public key cryptosystem, the sender has to trust while receiving the public key of the receiver and vice-versa and this is the challenge of public key cryptosystem. Man-in-the-Middle attack is very much possible on the existing Diffie-Hellman algorithm. In man-in-the-middle attack, the attacker exists in the public channel, the attacker receives the public key of both sender and receiver and sends public keys to sender and receiver which is generated by his own. This is how man-in-the-middle attack is possible on Diffie-Hellman algorithm. Denial of service attack is another attack which is found common on Diffie-Hellman. In this attack, the attacker tries to stop the communication happening between sender and receiver and attacker can do this by deleting messages or by confusing the parties with miscommunication. Some more attacks like Insider attack, Outsider attack, etc are possible on Diffie-Hellman. To reduce the possibility of attacks on Diffie-Hellman algorithm, we have enhanced the Diffie-Hellman algorithm to a next level. In this paper, we are extending the Diffie -Hellman algorithm by using the concept of the Diffie -Hellman algorithm to get a stronger secret key and that secret key is further exchanged between the sender and the receiver so that for each message, a new secret shared key would be generated. The second secret key will be generated by taking primitive root of the first secret key.