RVGAC: A Round-Variable Authentication Code Based on a Hybrid Rijndael–Feistel Block Cipher for Network Security
DOI:
https://doi.org/10.65204/djes.v3i3.1011Keywords:
Block cipher , Symmetric encryption, RVGACAbstract
The increasing frequency and sophistication of cyberattacks have made data confidentiality and integrity critical challenges in modern networked systems. Encryption algorithms, particularly symmetric-key block ciphers, form the foundation of contemporary cybersecurity infrastructures. Although well-established block ciphers such as AES provide strong security guarantees, their fixed round structures and static diffusion paths may introduce structural regularities when deployed in large-scale or long-term network environments.This paper proposes a novel symmetric-key block cipher, referred to as the Round Variable Generation Authentication Code (RVGAC), which integrates Feistel-based round swapping with Rijndael-inspired nonlinear substitution and linear diffusion mechanisms. The proposed design introduces controlled round-variable behavior, increasing cryptographic uncertainty and reducing exploitable statistical correlations. RVGAC achieves confusion through nonlinear FS-Boxes and S-Boxes, and diffusion through AddRoundKey, P-Vector permutation, MixColumns, and Feistel swapping.The security and randomness of the generated ciphertext sequences are evaluated using the NIST Statistical Test Suite and Strict Avalanche Criterion (SAC) analysis. Experimental results demonstrate strong statistical randomness and effective diffusion across multiple data types. These findings indicate that RVGAC is a suitable and robust block cipher for modern network security applications.
References
Y. Zhong and J. Gu, “Lightweight block ciphers for resource-constrained environments: A comprehensive survey,” Futur. Gener. Comput. Syst., vol. 157, pp. 288–302, 2024.
N. Mouha and M. Dworkin, Report on the block cipher modes of operation in the NIST SP 800-38 series. US Department of Commerce, National Institute of Standards and Technology, 2024.
S. M. Al-Nofaie, S. Sharaf, and R. Molla, “Design trends and comparative analysis of lightweight block ciphers for IoTs,” Appl. Sci., vol. 15, no. 14, p. 7740, 2025.
S. Aziz et al., “Next-Generation Block Ciphers: Achieving Superior Memory Efficiency and Cryptographic Robustness for IoT Devices,” Cryptography, vol. 8, no. 4, p. 47, 2024.
A. Gour, S. S. Malhi, G. Singh, and G. Kaur, “Hybrid cryptographic approach: for secure data communication using block cipher techniques,” in E3S Web of Conferences, EDP Sciences, 2024, p. 1048.
E. Almaraz Luengo and J. Román Villaizán, “Cryptographically secured pseudo-random number generators: Analysis and testing with NIST statistical test suite,” Mathematics, vol. 11, no. 23, p. 4812, 2023.
M. S. Naik, M. Mallam, and C. S. Nataraju, “Machine learning-based lightweight block ciphers for resource-constrained internet of things networks: a review.,” Int. J. Electr. Comput. Eng., vol. 14, no. 3, 2024.
Z. Liu, S. Han, Q. Wang, W. Li, Y. Liu, and D. Gu, “New insights on linear cryptanalysis,” Sci. China Inf. Sci., vol. 63, no. 1, p. 112104, 2020.
L. Bassham et al., “A statistical test suite for random and pseudorandom number generators for cryptographic applications,” National Institute of Standards and Technology, 2008.
C. E. Shannon, “Communication theory of secrecy systems,” Bell Syst. Tech. J., vol. 28, no. 4, pp. 656–715, 1949.
J. Daemen and V. Rijmen, “Te Design of Rijndael: Te Advanced Encryption Standard (AES),” 2020, Springer Nature, NY, USA.
M. Matsui, “Linear cryptanalysis method for DES cipher,” in Workshop on the Theory and Application of of Cryptographic Techniques, Springer, 1993, pp. 386–397.
M. Bellare, J. Kilian, and P. Rogaway, “The security of the cipher block chaining message authentication code,” J. Comput. Syst. Sci., vol. 61, no. 3, pp. 362–399, 2000.
S. H. Abdelhaleem, S. K. Abd-El-Hafiz, and A. G. Radwan, “Analysis and guidelines for different designs of pseudo random number generators,” IEEE Access, 2024.
