An Application of Radio Geometric Mean labeling in Encoding and Decoding

Abstract

Graph theory is an ocean of NP-hard problems, which can be easily adapted to cryptography. Keys for cryptographic algorithms are lengthy number sequences that are generated by random number generators. These generators follow a uniform distribution that is easy to retrieve by hackers, as any number has an equal chance of being generated. Using graph labeling techniques, one can generate these keys in a more efficient and faster way. In this work, technique involves a labeling type called Radio geometric mean labeling and Radio geometric mean labeled graph is used as the cipher graph. The receiver receives the encoded text in the form of vertex or edge sequence of the cipher graph, which is not easy for an intruder to hack, as the labeling technique itself is an NP-hard problem.