Cryptographic key generation using graph theory and AI-based combinatorics

Deshmukh, Pradeep Kundlik; Naik, Ketaki; Tambakhe, Manoj D.; Mamadiyarov, Zokir; Joshi, Navneet; Varma, V. K. Chaitanya

doi:10.47974/JDMSC-2521

Open Access Research Article

Cryptographic key generation using graph theory and AI-based combinatorics

^*Pradeep Kundlik DeshmukhCorresponding authorpkd.comp@coeptech.ac.inDepartment of Computer Science and EngineeringCOEP Technological UniversityPune, Maharashtra, 411005, IndiaView full profile → , Ketaki Naikketaki.naik@bharatividyapeeth.eduDepartment of Information TechnologyBharati Vidyapeeth’s College of Engineering for WomenPune, Maharashtra, 411043, IndiaView full profile → , Manoj D. Tambakhemdtambakhe@sipnaengg.ac.inDepartment of Information TechnologySipna College of Engineering & TechnologyAmravati, Maharashtra, 444607, IndiaView full profile → , Zokir Mamadiyarovmamadiyarov_zokir@mamunedu.uz zokir_mamadiyarov@tues.uz z.mamadiyarov@tsue.uzAffiliation 1Department of EconomicsMamun UniversityKhiva, UzbekistanAffiliation 2Department of Finance and TourismTermez University of Economics and ServiceUzbekistanAffiliation 3Department of Bank Accounting and AuditingTashkent State University of EconomicsTashkent, UzbekistanView full profile → , Navneet Joshinavneet.nimt@gmail.comDepartment of MathematicsGraphic Era Hill UniversityBhimtal Campus, Uttarakhand, 263136, IndiaView full profile → , V. K. Chaitanya Varmachaitanyavegesna27@gmail.comDepartment of Mechanical EngineeringSagi Rama Krishnam Raju Engineering CollegeChinamiram Rural, Andhra Pradesh, 534204, IndiaView full profile →

* Corresponding author · click or hover a name for details

pp. 749–757Vol. 29Issue 2-AFebruary 2026DOI: 10.47974/JDMSC-2521 Crossmark XML

Received:: 13 May 2025
Published Online:: 04 Feb 2026
Article type:: Research Article
Language:: EN
Article no.:: JDMSC-2521
Pages:: 749–757

Abstract

AI-based combinatorial optimization and graph theory are used together in this study to show a new way to make encryption keys. Graph structures like vector measure spaces and orthogonal sequences are used to make complicated, safe keys that can’t be broken by standard means. AI strategies, like genetic algorithms and reinforcement learning, improve key risk and entropy by way of making complex strategies greater efficient. The device thinks of key advent as a design trouble, which makes it clean to traverse and find styles. Including AI-driven random techniques makes key creation an awful lot faster and greater reliable. Algorithmic workflows show how to make keys which might be scalable and adaptable, which is good for modern-day cryptographic systems.

Keywords

Graph theory Combinatorial optimization Genetic algorithms reinforcement learning Cryptographic key generation

Subject Classifications

31A1033E30

References

[1] S. Kumar, W. M. Lim, U. Sivarajah, and J. Kaur, “Artificial intelligence and blockchain integration in business: Trends from a bibliometric-content analysis,” Information Systems Frontiers, vol. 25, pp. 871–896 (2023).
[2] N.-A. Perifanis and F. Kitsios, “Investigating the influence of artificial intelligence on business value in the digital era of strategy: A literature review,” Information, vol. 14, pp. 85 (2023).
[3] W. Nasar, R. Da Silva Torres, O. E. Gundersen, and A. T. Karlsen, “The use of decision support in search and rescue: A systematic literature review,” ISPRS Int. J. Geo-Inf., vol. 12, pp. 182 (2023).
[4] X. Liu, X. Wang, J. Chang, H. Zhang, and P. Cao, “Landscape analysis and overview of the literature on oxidative stress and pulmonary diseases,” Front. Pharmacol., vol. 14, pp. 1190817 (2023).
[5] S. S. Dhanda, B. Singh, and P. Jindal, “Demystifying elliptic curve cryptography: Curve selection, implementation and countermeasures to attacks,” Journal of Interdisciplinary Mathematics, vol. 23, no. 2, pp. 463–470 (2020).
[6] W. Jiang, P. S. Sousa, M. R. Moreira, and G. M. Amaro, “Lean direction in literature: A bibliometric approach,” Prod. Manuf. Res., vol. 9, pp. 241–263 (2021).
[7] A. Kumar, P. Dadheech, V. Singh, R. C. Poonia, and L. Raja, “An improved quantum key distribution protocol for verification,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 22, no. 4, pp. 491–498 (2019).
[8] A. Bunjak, M. Černe, and E. L. Schölly, “Exploring the past, present, and future of the mindfulness field: A multitechnique bibliometric review,” Front. Psychol., vol. 13, pp. 792599 (2022).
[9] Saxena and Ratnesh Rajan., “Enumeration technique for set covering problems: a combinatorial approach.” Journal of Interdisciplinary Mathematics, vol. 9, no. 2, pp. 421-430 (2006).
[10] A. Kumar, P. Dadheech, V. Singh, L. Raja, and R. C. Poonia, “An enhanced quantum key distribution protocol for security authentication,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 22, no. 4, pp. 499–507 (2019).
[11] R. Ranasinghe, P. Athukorala, and P. Athurugiriya, “A modified ElGamal-like cryptosystem,” J. Discrete Math. Sci. Cryptogr., vol. 28, no. 3, pp. 631–639 (2025).

Views: 320Downloads: 176Citations: 0