Symmetric Key Encryption Using Modular Traversal of Ananta-Graphs

Abstract

In this paper, we propose a novel symmetric key encryption scheme inspired by modular traversal of Ananta-Graphs. The system utilizes an iterative traversal mechanism over modular arithmetic to generate a shared secret key between communicating parties without directly exchanging private information. By leveraging the predictable yet secure path generation properties of the modular traversal, the shared key is derived independently by both participants, ensuring confidentiality and integrity. The encryption and decryption processes employ lightweight operations mapped into readable alphabetic ciphertext. Experimental analysis demonstrates consistent key synchronization, efficient encryption-decryption, and resilience against cryptographic attacks, particularly when using large prime moduli. This study highlights the potential of Ananta-Graph inspired modular traversal techniques for lightweight and secure symmetric cryptographic systems.