Performance Improvement in Diffie–Hellman Algorithm

Abstract

ABSTRACT
Communication is the important part in any type of network for making it possible to transfer data from one node to another. Communication needs quality and security for better performance and for acceptance of users and client companies. Quality is depending on length and a few different elements of community however safety could be very subject parameter in network as it is independent of community length and complexity. Safety has end up greater critical to personal laptop customers, organizations, and the military. Security became a major concern with the advent of internet and the history of security allows a better understanding of the emergence of security technology. Ensuring secure communication over internet is extremely challenging because of the dynamic nature of the network and the lack of centralized management. The internet structure itself allowed for plenty security threats to arise. The modified architecture of the internet can reduce the possible attacks that can be sent across the network. Knowing the attack methods, allows for the precise security to emerge Data integrity is quite an issue in security and to maintain that integrity we tends to improve as to provides the better encryption processes for security. For this reason, Diffie–Hellman key agreement protocol is introduced for secure communication over network, but Diffie–Hellman key agreement protocol implementations have been plagued by serious security flaws. The attacks can be very subtle and, more often than not, have not been taken into account by protocol designers. In our proposed work we provide harder encryption with enhanced public key encryption protocol for security and proposed work can be implemented into any network to provide better security. We have enhanced the hardness in security by improving the Diffie–Hellman encryption algorithm by adding some more security codes in current algorithm. In our work discuss both theoretical attacks against the Diffie–Hellman key agreement protocol and attacks based on implementation details and also we've got used a random parameter to make this algorithm more green. The random parameter generates new shared keys for each message that is exchanged between sender and receiver. So, different cipher text will be produced each time even for the same message. Thus, systems using this scheme will become more tolerant to various attacks.

Keywords: Cryptography, key exchange protocol, SSL, TLS

Cite this Article: Varsha Kumari, Gourav Mitawa. Performance Improvement in Diffie-Hellman Algorithm. International Journal of Telecommunications & Emerging Technologies. 2019; 5(1): 20–23p.