Security has become one of the major issues for data communication over wired and wireless networks. A dynamic routing algorithmhas being proposed that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popularrouting protocols, such as the Routing Information Protocol in wired networks and Destination-Sequenced Distance Vector protocol in wirelessnetworks, without introducing extra control messages. Our security-enhanced dynamic routing could be used with cryptography-based systemdesigns to further improve the security of data transmission over networks. In this paper, we present a novel encryption-less algorithm toenhance security in transmission of data in networks. The algorithm uses an intuitively simple idea of a jigsaw puzzle to break the transformeddata into multiple parts where these parts form the pieces of the puzzle. The algorithm is designed to provide information-theoretic (that is,unconditional) security by the use of a one-time pad like scheme so that no intermediate or unintended node can obtain the entire data. Anauthentication code is also used to ensure authenticity of every packet. Keywords: Data protection, Dynamic routing, Key management, One-time pad, Security algorithm, Security-enhanced data transmission.
Dynamic Routing of Data with Secure Cryptographic Techniques
2017-01-13
doi:10.26483/ijarcs.v1i4.200
International Journal of Advanced Research in Computer Science; Vol 1, No 4 (2010): November-December 2010; 414-419 ; 0976-5697 ; 10.26483/ijarcs.v1i4
Article (Journal)
Electronic Resource
English
Cryptographic techniques for satellite networks
AIAA | 1980
|Cryptographic Techniques for Information Security
British Library Online Contents | 1998
|