ENHANCING COMPUTATIONAL PERFORMANCE OF MINIMAL SPANNING TREE OF CERTAIN GRAPHS BASED ENCIPHERING TECHNIQUE USING SELF INVERTIBLE KEY MATRIX

These days, message encryption techniques are the most crucial methods for protecting our communications and data. Utilizing the internet and network connections has accelerated the development of message encryption technologies. It is potential for an assault, theft, or
hacking of the communications if sensitive, private messages are shared via insecure networks. Cryptographic techniques have been discovered to be crucial for reducing this term. There are various symmetric enciphering techniques; the Caesar Cipher, Hill Cipher, and other examples are a handful. The enciphering method described in this article uses a self-invertible key matrix and an adjacency matrix of the minimal spanning trees of some specific graphs, such as the Antenna graph, and Diamond graph to encrypt and decrypt the messages that are provided to it in order to produce a complex cipher text. We can decode the ciphertext without computing the inverse of the key matrix since we are employing the self-invertible matrix as a key matrix,
whose inverse always exists. Our ability to find the inverse of a key matrix is made easier by the reduction in computing complexity.