MATRIX-BASED GRAPH ENCRYPTION USING PAW GRAPH ADJACENCY AND INVERTIBILITY

In contemporary times, message encryption algorithms serve as one of the most essential security measures for protecting communication and data. The rapid growth of networks and the internet has significantly accelerated the advancement of encryption technologies. This paper
presents an encryption and decryption method based on the use of a self-invertible key matrix and the adjacency matrix of paw graphs to generate a complex cipher. Notably, because the key matrix is self-invertible—meaning its inverse always exists—there is no need to explicitly compute the matrix inverse during decryption. This characteristic effectively reduces computational complexity and enhances the efficiency of the decryption process.