Randomly Generated Algorithms and Dynamic Connections

Abstract

In the modern computer world, maintaining the information is very difficult. Some interrupts may occur on the local system (attack) or network based systems (network attack). Without security measures and controls in place, our data might be subjected to an attack. Several passive attacks like wire-tapping, port scanning etc. are well known that are used to monitor communication between nodes and also further used in other types of active attacks like man-in-the-middle attack etc. The man-in-the-middle attack, in cryptography and computer security is a form of active eavesdropping in which independent connections are made by the attacker with the victims so that attacker can relay messages between them. The entire conversation is controlled by the attacker making the victims believe that they are communicating with each other privately. Our approach to stop these types of attack is described as, once the initial authentication is done between the communicating nodes, they can start communicating using some standard encryption algorithm like DES, TEA or public key cryptography. But instead of using the same static communication channel and encryption algorithm, we will switch between different algorithms after a certain interval of time which has already been available with nodes.