The Role of Planar Graphs in Encryption and Decryption in Secure Communications: An Example

This paper presents an innovative algorithm for encryption and decryption in Python, using the properties of planar graphs to ensure secure data transmission. The proposed symmetric encryption method uses the concepts of cycle graphs, planar graphs, and minimal spanning trees to generate a complex ciphertext using a shared key. This approach improves the security and efficiency of the encryption process. By employing these graph-based structures, the algorithm generates intricate patterns that enhance the security of the encrypted data, making it resistant to unauthorized decryption. The use of cycle graphs contributes to creating complex, non-repetitive patterns, while planar graphs help in efficiently organizing data within a secure structure. The minimal spanning tree concept plays a critical role in improving the computational efficiency of the encryption and decryption operations. This novel approach not only strengthens security but also offers a more efficient alternative to traditional encryption techniques. The use of planar graphs is integral in organizing and structuring the encryption process, while minimal spanning trees improve computational efficiency for both encryption and decryption operations. This approach not only offers an important level of security but also introduces an efficient and scalable method for secure data encryption and decryption in Python). Keywords: Encryption-Decryption, Planar Graph, Cycle Graph.