A Systematic Review of Graph-Theoretic Approaches to: Lightweight Block Cipher Design: Methods, Architectures, and Future Research Directions

Abstract

The rapid expansion of resource-constrained environments such as Internet of Things ecosystems, embedded systems, and edge computing platforms has intensified the need for lightweight cryptographic primitives that ensure robust security with minimal computational overhead. Lightweight block ciphers have emerged as a critical solution, yet their design remains a complex challenge due to trade-offs among security, efficiency, and implementation cost. In recent years, graph-theoretic approaches have gained prominence as a systematic framework for modeling, analyzing, and optimizing cipher structures, particularly in substitution-permutation networks and diffusion layers. This paper presents a comprehensive systematic review of graph-theoretic techniques applied to lightweight block cipher design, focusing on methodologies, architectural innovations, and emerging trends. The review synthesizes findings from recent studies between 2018 and 2025, highlighting the role of graph connectivity, expander graphs, and algebraic graph models in enhancing diffusion, resistance to cryptanalysis, and structural efficiency. Additionally, the integration of Generative Artificial Intelligence in automating cipher design and optimization is critically examined. The contributions of this work include a structured analysis of state-of-the-art approaches, identification of research gaps, and the formulation of future research directions that bridge graph theory, cryptography, and intelligent system design. The findings demonstrate that graph-theoretic models significantly improve the balance between security and efficiency, while AI-driven techniques further accelerate innovation in cipher construction.