A SYMMETRIC BLOCK CIPHER BASING ON MINIMAL SPAN TREE ALGORITHM OF UNDIRECTED WEIGHTED GRAPH

In our now hyper digitalized world, the growth of communication systems is straining our ability to secure systems due to the increasing effects of cyber security threats on the reliability and safety of our technologies. Modern cryptography generally offers combinations of three principles: confidentiality, integrity and authentication. This paper proposes a new symmetric block cipher created from terms of graph theory to increase security in encryption. We suggest not only the use of a graph, but a 2-phase encryption capabilities. In the first phase, the plaintext is encrypted with an adjacency matrix from an undirected weighted graph derived from the message characters while the second phase is simply a bitwise XOR operation which will further obscure data. The encryption keys from both phases are generated from a minimum spanning tree (MST) created with a master key that is used to create independent yet shared keys. In this case, multiple parties (multi-party) can continue to use more random ASCII-based block keys in the cloud that are shared to secure communication. The participants independently derive master and session keys between one another using authentic sharing systems to encrypt keys and data independent from one another to help support privacy and scaling with participants involved. The encryption schemes outlined in this paper provide a very secure form of dynamic encryption protocol managing keys for data, and are applicable to distributed networks for unique key requirements and security against brute-force attacks.