An encryption and decryption technique using Planar graph with Self- Invertible matrix

Abstract

These days, message encryption is the most crucial aspect in protecting electronic mail or online communications between people. As the internet and network links tend to expand and evolve, message encryption techniques are becoming increasingly widespread. Communicating private and confidential messages across unsecured networks puts communications at risk of being attacked, stolen, or hacked. Encryption techniques are vital in minimizing this jargon and providing higher-quality security. Numerous symmetric enciphering methods, such as the Caesar and Hill ciphers, are available. In this study, we present an encryption method involving a Planar Graph, an adjacency matrix, and a key matrix created by applying permutation matrix formulation on a self-invertible matrix. This strategy is employed to encrypt and decrypt messages, resulting in a secure cipher text.