The concept of Minimal Spanning Tree (MST) for Symmetric Encryption

Abstract

As the digital communication has become a vital part of the human life nowadays, cybercrimes are ever expanding. One major tool to protect the message from hacking and tampering is concealing the original information.  Modern cryptography not only concerns the encryption of the message but also focuses on the protection of the encrypted information from cyber-attacks.Apart from secret communication modern cryptography focuses on authentication and integrity of the message. The present paper explains a symmetric block cipher basing on graph structures. In this technique the message is encrypted twice. The first stage encryption using adjacency matrix of undirected graph; the second stage using exclusive OR (XOR) operation on the output of first stage.  Encryption/Decryption Keys are distinct for distinct blocks and distinct rounds; derived from Minimum Span Tree (MST) technique of an undirected graph. Here multiple peers can communicate messages simultaneously. One of the entries selects some random ASCII characters whose number is same as the block length and uploads those characters in the cloud. All the members of the group establish block keys using key generation technique which is secret among them.