An Improved Graph-Theoretic Model for Symmetric Key Cryptography Using Anchored Laplacian Matrices

In this paper, there is a new approach whereby a graph theory is combined with a symmetric cryptography to ensure the safety of data against unclaimed access. Using simple graph to matrix conversion, our method will convert plaintext to weighted-multiple graphs before being converted into matrices of matrix form (Anchored Laplacian Matrix) and transmitting the ciphertext in the form of matrices to the receiver. Security in this method is improved since an invertible matrix in a finite field is employed as a secret key leading to the creation of several ciphertexts whose total size is much bigger than that of the original message. This complicates it further and hard to crack/hack as compared to current cryptographic algorithms.