Matrix group representations in cryptographic transformations
Sachin Arun Thanekarsachin.sangamner@gmail.comDepartment of Information TechnologySanjeevani College of EngineeringKopargaon, Maharashtra, 423603, IndiaView full profile → , *Devata R. AnekarCorresponding authordevata.anekar@vit.eduDepartment of Information TechnologyVishwakarma Institute of TechnologyPune, Maharashtra, 411037, IndiaView full profile → , Ranjeetsingh Suryawanshiranjeetsingh.suryawanshi@vit.eduDepartment of Computer EngineeringViswakarma Institute of TechnologySavitribai Phule Pune UniversityPune, Maharashtra, 411037, IndiaView full profile → , Anuradha Narendra Nawatheanuradhanawathe@gmail.comDepartment of Information TechnologyAmrut Vahini College of EngineeringSangamner, Maharashtra, 422608, IndiaView full profile → , Yogesh Shepalyogeshshepal@gmail.comDepartment of Computer Science & EngineeringASM’s Nextgen Technical CampusPune, Maharashtra, 410506, IndiaView full profile → , G. Kavithamilind.ovhal@nmiet.edu.inDepartment of Mechanical EngineeringPCET’s Nutan Maharashtra Institute of Engineering & TechnologyPune, Maharashtra, 410507, India0000-0001-9531-9388View full profile → , Monali Gulhanemonali.gulhane4@gmail.comDepartment of Computer Science & EngineeringNagpur Campus, Symbiosis International (Deemed University)Symbiosis Institute of TechnologyPune, Maharashtra, 440008, 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-3050
- Pages:
- 4273–4288
Abstract
The growing need of safe data transmission in the contemporary digital setting, such as cloud-based, Internet of Things (IoT), and distributed systems, has revealed the weaknesses of the traditional cryptography methods, especially in the form of new quantum threats. Traditional approaches founded on number-theoretic conjectures are now facing challenges, and more multifaceted and scalable mathematical theories need to be pursued. This work tackles this problem by suggesting a new cryptographic transformation model that is based on matrix group representations, which are defined on finite fields. The main aim of the work is to construct a mathematically sound and implementation-friendly encryption scheme that increases the security level by high-dimensional, non-commutative transformations. The methodology consists of a representation mapping of plaintext data in the form of vectors and a series of reversible matrix transformations, based on group elements. The system combines the process of key generation, encryption, and decryption in one algebraic framework and is executed in Python (NumPy, SciPy) and MATLAB to perform efficient operations on matrices. The reported experimental results indicate ciphertext entropy of 7.98 bits per byte and an avalanche effect of 52.6%, compared with 7.95 bits and 50.1%, respectively, for the AES baseline. These preliminary findings suggest favorable statistical randomness and diffusion characteristics, although reproducibility requires further documentation of the experimental protocol and independent validation of the reported measurements. Comparative analysis to AES indicates that the proposed scheme has a slightly higher computational overhead, but provides a better key space, structural complexity, and resistance to attacks. Scalability tests ensure that the system works effectively with a moderate size of matrices as well as various data sets, such as text and picture data. Overall, the proposed framework provides safe, scalable and versatile solution to next generation cryptography usage, particularly high security and post-quantum settings.
Keywords
Subject Classifications
References
[1] M. Harmalkar, K. Jain, and P. Krishnan, “A survey of post quantum key encapsulation mechanism,” in Proc. 5th Int. Conf. Mobile Computing and Sustainable Informatics (ICMCSI), Lalitpur, Nepal, pp. 141–149 (Jan. 2024).
[2] V. V. Williams, Y. Xu, Z. Xu, and R. Zhou, “New bounds for matrix multiplication: From alpha to omega,” in Proc. Annu. ACM-SIAM Symp. Discrete Algorithms (SODA), Alexandria, VA, USA, pp. 3792–3835 (Jan. 2024).
[3] B. Mahaboob, “On mathematical and statistical aspects of linear models,” AIP Conf. Proc., vol. 2375, pp. 020035-1–020035-9 (2021), doi: 10.1063/5.0066924.
[4] K. Bhagyalakshmi, “Ternary T-SO-semmings-4,” Int. J. Adv. Sci. Technol., vol. 28, no. 14, pp. 172–180 (2019), doi: 10.35740/ijitee.L3577.1051219.
[5] S. Dobson, S. Galbraith, and B. Smith, “Trustless unknown-order groups,” Math. Cryptol., vol. 1, pp. 25–39 (2022).
[6] Y. Lindell, “Fast secure two-party ECDSA signing,” J. Cryptol., vol. 34, p. 44 (2021).
[7] S. Korzilius and B. Schoenmakers, “Divisions and square roots with tight error analysis from Newton–Raphson iteration in secure fixed-point arithmetic,” Cryptography, vol. 7, p. 43 (2023).
[8] 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.
[9] N. David, T. Espitau, and A. Hosoyamada, “Quantum binary quadratic form reduction,” Cryptology ePrint Archive (2022).
[10] A. F. De Abiega-L’Eglisse, K. A. Delgado-Vargas, H. A. Ortega Alcocer, G. Gallegos-García, and E. Sarmiento Rosales, “A post-quantum end-to-end secure protocol for instant messaging applications,” Cryptography, vol. 10, p. 28 (2026), doi: 10.3390/cryptography10030028.
[11] F. E. Merga, G. F. Duressa, V. N. Mishra, and L. Mishra, “Parameter uniform numerical scheme for singularly perturbed time-fractional delay parabolic reaction-diffusion problems,” Journal of Interdisciplinary Mathematics, vol. 29, no. 4, pp. 825–840 (2026), doi: 10.47974/JIM-2269.
[12] J. Rong, X. Dong, Y. Han, and R. Cheng, “S-box construction algorithm based on neural networks and genetic algorithms,” in Proc. 2nd Int. Conf. Electronics, Computers and Communication Technology, Chengdu, China, pp. 113–118 (Oct. 2024).
[13] F. Artuğer and F. Özkaynak, “A new chaotic system and its practical applications in substitution box and random number generator,” Multimedia Tools Appl., vol. 83, pp. 90053–90067 (2024).
[14] D. F. Raj, “Comparative Evaluation of CNN–Autoencoder with existing models for Security Threat Detection in Cloud Environments”, IJACECT, vol. 14, no. 2, pp. 71–83 (Dec. 2025).
[15] A. V. Sokolov and V. V. Radush, “A method for synthesis of S-boxes with good avalanche characteristics of component Boolean and quaternary functions,” J. Discrete Math. Sci. Cryptogr., vol. 26, no. 2, pp. 561–572 (2023).
