A Non-Linear Symmetric Cipher Using Petersen Graph for Dat a Security

This paper presents a non-linear symmetric encryption-decryption process using Petersen graph, with the objective of providing an alternative way of securing data. The adjacency matrices are generated by first transforming the plaintext into Affine which is then mapped to the vertices of a weighted Petersen graph. Encryption is performed as C_i = A_i × K + T, i = 1,2,3, where A_i, are the adjacency matrices, K, is a random key, and T, is an added security parameter generated from K. Reliability of the method was validated through successful encryption and decryption of a sample text message “DANGERSIGN”, while the non-linear symmetric structure and the complex topology of the Petersen graph contribute to increased resistance against cryptanalytic attacks.