{'fraction_non_alphanumeric': 0.03153153153153153, 'fraction_numerical': 0.0, 'mean_word_length': 4.955357142857143, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Authenticated Diffie-Hellman Key Exchange Algorithm

The ability to distribute cryptographic keys has been a challenge for centuries. The Diffie-Hellman was the first practical solution to the problem .However, if the key exchange takes place in certain mathematical environments, the key exchange become vulnerable to a specific Man-inMiddle attack, first observed by Vanstone. This paper is an effort to solve a serious problem in Diffie-Hellman key exchange, that is, Man-in-Middle attack. In this paper we have used RSA algorithm along with Diffie-Hellman to solve the problem. We explore the Man-in-Middle attack, analyse the countermeasures against the attack.