In the dynamic realm of cybersecurity, it is important to create a strong cryptographic technique to protect sensitive data against advanced threats. This paper introduces an innovative encryption and decryption technique leveraging graph theory and matrix algebra, especially through the use of pair sum modulo (PSM) labeling of graphs, adjacency matrices, and self-invertible matrices. The PSM labeling for a simple undirected graphG(V
Published on 07/04/25
Accepted on 02/03/25
Submitted on 20/01/25
Volume 41, Issue 1, 2025
DOI: 10.23967/j.rimni.2025.10.63629
Licence: CC BY-NC-SA license
Are you one of the authors of this document?