Detailed Proposed Algorithm: Symmetric Encryption and Decryption Using Eulerian Circuits in Simple Graphs
Journal of Computational Mathematica · 30.12.2026 · 10 (2) · 48-59
DOI: 10.26524/cm239 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Computational Mathematica, online erschienen am 30.12.2026. Verfasst von Yashmin Banu und 2 weiteren Autor:innen.
Abstract (Originalsprache)
This paper proposes a novel symmetric-key encryption scheme using simple weighted graphs and Eulerian circuits. Unlike NP-complete Hamiltonian cycle methods, it employs polynomial-time Eulerian circuits via Hierholzer‘s algorithm. Plaintext is mapped to a weighted graph using a secret key. An Eulerian circuit generates a dynamic key and Euler Tour Matrix. Encryption uses matrix multiplications with a shared upper triangular key and modular reduction. Decryption reverses the operations using matrix inverses. Statistical tests confirm strong diffusion and randomness. The scheme provides better efficiency and scalability than traditional Hamiltonian-based approaches.
Zitieren
APA
Banu, Y., rath, B. K., & Gountia, D. (2026). Detailed Proposed Algorithm: Symmetric Encryption and Decryption Using Eulerian Circuits in Simple Graphs. Journal of Computational Mathematica, 10(2), 48-59. https://doi.org/10.26524/cm239
Vancouver
Banu Y, rath BK, Gountia D. Detailed Proposed Algorithm: Symmetric Encryption and Decryption Using Eulerian Circuits in Simple Graphs. Journal of Computational Mathematica. 2026;10(2):48-59. doi:10.26524/cm239
BibTeX
@article{Banu2026,
author = {Banu, Yashmin and rath, Biplab Kumar and Gountia, Debasis},
title = {Detailed Proposed Algorithm: Symmetric Encryption and Decryption Using Eulerian Circuits in Simple Graphs},
journal = {Journal of Computational Mathematica},
year = {2026},
volume = {10},
number = {2},
pages = {48--59},
doi = {10.26524/cm239}
}
EUVIMED