Many network applications involve data transfer; therefore there is a need to have a secure network, which can be achieved through the use of cryptography. In this paper, we present an innovative algorithm for encryption and decryption using connected graphs. Message represented by a connected graph can be encrypted by using a spanning tree of the graph. Any message represented in the graph is either on a branch or on a chord with respect to the spanning tree. Depending whether it is a branch or a chord graph theorems are applied to the spanning tree for both encryption and decryption purposes. This approach used to encrypt leads to more secure data transfer. © 2012 Taylor & Francis Group, LLC.
View more info for "Fundamental circuits and cut-sets used in cryptography"
|Journal||Journal of Discrete Mathematical Sciences and Cryptography|
|Publisher||Informa UK Limited|