Oblong Slant For Encryption And Decryption Of Coupled Scheme To Unique Route In Associated Grid

Abstract

A graph is, informally, a collection of nodes connected by a collection of edges. A node in a graph is a location where two or more branches covered. One branch may occasionally be the sole one to connect to the other node. A branch is a line segment that connects two nodes. Encryption in cryptography is the process of encoding messages so that only authorized parties may decode them to read. Every day, more digital information is being produced and shared online. The quantity a result of the weaknesses in the network and software, the number of security assaults/threats has also increased. The proposed research, a novel algorithm to capture the data encryption and decryption technique by graph theoretical manner using hexadecimal values is proposed.  To perform substitution, first-level encryption uses binary values. As the second level of encryption, Hexadecimal dialogue is utilized to achieve permutation. A key is not explicitly used by the algorithm to encrypt the data. Through experimentation, the algorithm has been validated.