Algebraic frameworks for transparent cryptographic systems
*Amit Kumar BhanjaCorresponding authorakbhanja10@gmail.comDepartment of ManagementGNIOT Institute of Management StudiesGreater Noida, Uttar Pradesh, 201310, IndiaView full profile → , Madasu Ashwan Kumarashwan1750@vardhaman.orgDepartment of Computer Science and Engineering (Data Science)Vardhaman College of EngineeringShamshabad, Hyderabad, Telangana, 501218, IndiaView full profile → , Gaikwad Vidya Shrimantvidya.gaikwad@viit.ac.inDepartment of Computer EngineeringVishwakarma Institute of TechnologyPune, Maharashtra, 411037, IndiaView full profile → , Tirukoti Sudha Ranisudharani.tirukoti@adityauniversity.inDepartment of Computer Science and EngineeringAditya UniversitySurampalem, Kakinada District, Andhra Pradesh, 533437, IndiaView full profile → , Manoj I. Patelmanoj.patel@gokuluniversity.ac.inFaculty of Computer Science and ApplicationsGokul Global UniversitySidhpur, Gujarat, 384151, India0009-0009-0731-9528View full profile → , D. Balajibalaji@avit.ac.inDepartment of Humanities and Sciences (Mathematics Division)Aarupadai Veedu Institute of TechnologyVinayaka Mission’s Research Foundation (Deemed to be University)Paiyanoor, Chennai, Tamil Nadu, 603104, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Apr 2026
- Published Online:
- 31 Oct 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-3016
- Pages:
- 3875–3886
Abstract
Cryptographic systems are transparent to achieve trade-offs between high security and verifiability and interpretability, and do so through the use of rigorous algebraic structures. The paper gives a single algebraic framework that combines the theory of groups, finite field theory, ring theory and lattice theory to construct transparent and auditable cryptographic mechanisms. The offered framework codifies encryption and decryption procedures with the help of the mappings of polynomials and structured transformations of algebras, which allows tracing them without any loss of confidentiality. The mathematical preliminaries form a basis to build safe primitives, whereas the framework design focuses on modularity and scalability as well as classical and quantum attacks. The method increases the transparency of the system by making it possible to obtain formal verification of the operations and structural consistency checks. Experimental analysis shows high efficiency, less ambiguity in computations and high resistance to adversarial models. The findings point to the fact that it is possible to achieve algebraic transparency with high security, which will enable next-generation cryptographic systems in distributed, regulated, and privacy-sensitive systems.
Keywords
Subject Classifications
References
[1] D. Zhao, “Compile-time fully homomorphic encryption: Eliminating online encryption via algebraic basis synthesis,” Cryptography, vol. 9, no. 2, Art. no. 44 (2025), doi: 10.3390/cryptography9020044.
[2] A. Hasić, M. Azizović, E. Azizović, and M. Saračević, “Solvability and nilpotency of Lie algebras in cryptography and steganography,” Mathematics, vol. 13, no. 11, Art. no. 1824 (2025), doi: 10.3390/math13111824.
[3] Q. Wu, J. Zhang, and Z. Li, “Generalized NTRU algorithms on algebraic rings,” Electronics, vol. 13, no. 21, Art. no. 4293 (2024), doi: 10.3390/electronics13214293.
[4] E. González Fernández, G. Morales-Luna, and F. Sagols, “A zero-knowledge proof system with algebraic geometry techniques,” Applied Sciences, vol. 10, no. 2, Art. no. 465 (2020), doi: 10.3390/app10020465.
[5] K. Somsuk, “Comparative analysis of Kyber-512, RSA, ECC and AES-128 for secure communication in resource-constrained systems,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 29, no. 4, pp. 1799–1821 (2026), doi: 10.47974/JDMSC-2591.
[6] A. Odeh, A. Abu Taleb, T. Alhajahjeh, F. Navarro, A. Ayesh, and M. Faezipour, “A privacy-enhancing image encryption algorithm for securing medical images,” Symmetry, vol. 17, no. 9, Art. no. 1470 (2025), doi: 10.3390/sym17091470.
[7] M. H. Noorallahzadeh and R. Alimoradi, “A new bilinear pairing-based searchable encryption scheme,” Journal of Information and Optimization Sciences, vol. 47, no. 4, pp. 1377–1396 (2026), doi: 10.47974/JIOS-1607.
[8] D. Palma and P. L. Montessoro, “A post-quantum cryptography enabled feature-level fusion framework for privacy-preserving multimodal biometric recognition,” Cryptography, vol. 9, no. 4, Art. no. 72 (2025), doi: 10.3390/cryptography9040072.
[9] K. A. Sattar, T. Haider, U. Hayat, and M. D. Bustamante, “An efficient and secure cryptographic algorithm using elliptic curves and max-plus algebra-based wavelet transform,” Applied Sciences, vol. 13, no. 14, Art. no. 8385 (2023), doi: 10.3390/app13148385.
[10] M. Durcheva and K. Danilchenko, “Secure key exchange in tropical cryptography: Leveraging efficiency with advanced block matrix protocols,” Mathematics, vol. 12, no. 10, Art. no. 1429 (2024), doi: 10.3390/math12101429.
[11] H. Yan, L. Wu, Q. Sun, and P. He, “Lattice-based cryptographic accelerators for the post-quantum era: Architectures, optimizations, and implementation challenges,” Electronics, vol. 15, no. 2, Art. no. 475 (2026), doi: 10.3390/electronics15020475.
[12] R. C. Poonia, R. Almakki, A. K. J. Saudagar, A. Altameem, and M. Albathan, “An optimization approach for real-time object detection in IoT devices through edge computing and deep learning,” Journal of Information and Optimization Sciences, vol. 45, no. 5, pp. 1465–1475 (2024), doi: 10.47974/JIOS-1768.
[13] Y. Yang, S. Han, P. Xie, Y. Zhu, Z. Ding, S. Hou, S. Xu, and H. Zheng, “Implementation and optimization of zero-knowledge proof circuit based on hash function SM3,” Sensors, vol. 22, no. 16, Art. no. 5951 (2022), doi: 10.3390/s22165951.
[14] A Nitaj and T. Rachidi, “Applications of neural network-based AI in cryptography,” Cryptography, vol. 7, no. 3, Art. no. 39 (2023), doi: 10.3390/cryptography7030039.
