An encryption technique using the adjacency matrices of certain graphs with a self-invertible key matrix

Department of Mathematics, Vels Institute of Science, Technology & Advanced Studies (VISTAS), India

^* Corresponding author: mohan.phd@velsuniv.ac.in

Abstract

The most important approaches for safeguarding our communications and data nowadays are message encryption techniques. The use of the internet and network communications has increased the pace of message encryption technology development. Sharing sensitive, private messages through unsecured networks makes it possible for an attack, theft, or hacking of the messages. In order to reduce this term, cryptographic methods have been found essential. There are several symmetric enciphering methods; a few examples are the Caesar Cipher, Hill Cipher, and others. In order to generate a complex cipher text, the enciphering method described in this article encrypts and decrypts the messages given to it using a selfinvertible key matrix and an adjacency matrix of certain graphs like A graph, Centipede C2, Domino graph. Since we are using the self-invertible matrix as a key matrix, whose inverse always exists, thus we can decode the ciphertext without computing the inverse of the key matrix. The lessening in computational complexity facilitates our ability to determine the inverse of a key matrix.