Matrix Rotation Cipher with Graph-Based Key Generation for Secure Message Encryption

In today's digital era, ensuring data security has become one of the most challenging issue facing by the society. This issue is especially critical due to the widespread transmission of data over unsecured wireless networks. Text-based data, commonly used in financial and other sensitive sectors, has become a prime target for attackers. Although various advanced methods have been developed to protect text data, significant security concerns still persist. In this cryptographic model, the authors introduced a secure message encryption technique by combining matrix rotation for message encryption and graph theory for dynamic key generation. The plaintext message is first represented as a matrix of characters, and the encryption is achieved through a series of matrix rotations. The key for these rotations is generated using the shortest path algorithm on a graph, where each vertex represents a unique character or symbol. The novelty of this approach lies in its hybrid use of linear algebra (matrix manipulation) and graph theory (shortest path key generation), offering both computational efficiency and enhanced security. This method provides a flexible, scalable, and secure approach for encrypting sensitive information.