Randomly Generated Algorithms and Dynamic Connections

Harmanpreet Singh¹ , Amritpal Singh Danewalia² , Deepak Chopra³ , aveen Kumar N⁴

Section:Technical Paper, Product Type: Journal
Vol.2 , Issue.1 , pp.1-4, Jan-2014

Online published on Feb 28, 2014

Copyright © Harmanpreet Singh, Amritpal Singh Danewalia, Deepak Chopra , Naveen Kumar N . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

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.

Key-Words / Index Term :
Communication System Security, Computer Network Security, Data Security, Internetworking, Network

References :
[1]. Derek Williams, “The Tiny Encryption Algorithm (TEA), CPSC 6128 – Network Security�, Columbus State University, 2008.
[2]. Prof K.Govinda, Dr.E.Sathiyamoorth, “Multilevel cryptography technique using graceful codes�, Journal of Global Research in Computer Science, 2011.
[3]. Matt Blumenthal,Encryption: “Strengths and Weaknesses of Public-key Cryptography�, Department of Computing Sciences, Villanova University, Villanova, PA 19085 CSC 3990 – Computing Research Topics
[4]. Niraj Kumar, Prof. Sanjay Agrawal, “Issues and Challenges in Symmetric Key based Cryptographic Algorithm�, International Journal of Advanced Research in Computer Science and Software Engineering, 2013.
[5]. C. Onwubiko, A. P. Lenaghan, “Managing Security Threats and Vulnerabilities for small to Medium Enterprises�, IEEE International Conference on Intelligence and Security Informatics 2007.
[6]. H Sathu, Network Security: “A Layered Ap-proach�, NZ Journal of Applied Computing & Information, 2002.
[7]. Yunhong GU, Robert L. Grossman, “UDP-based data transfer for high-speed wide area networks�, Science Direct, 2007.