Innovative Symmetric Encryption with Minimal Spanning Tree Approaches

Abstract

As digital communication becomes an integral part of daily life, the rise in cybercrime has become increasingly concerning. To safeguard messages from hacking and tampering, concealing original information is essential. Modern cryptography goes beyond simple message encryption, emphasizing the protection of encrypted data against cyber attacks. Besides enabling secure communication, modern cryptography also prioritizes message authentication and integrity. This paper presents a symmetric block cipher model that utilizes graph structures. The encryption process in this method occurs in two stages. In the first stage, the message is encrypted using the adjacency matrix of an undirected graph. The second stage then applies an exclusive OR (XOR) operation to the output from the first stage. Unique encryption and decryption keys are generated for each block and each round, derived through the Minimum Spanning Tree (MST) technique on an undirected graph.This approach enables multiple peers to exchange messages simultaneously. One of the participants selects random ASCII characters, equal in number to the block length, and uploads these to the cloud. All group members then generate block keys using a shared, confidential key generation technique.