Asosiy kontentga oʻtish
Maqola

Cryptographic key generation using graph theory and AI-based combinatorics

Pradeep Kundlik DeshmukhDepartment of Computer Science and Engineering, COEP Technological University, Pune, Maharashtra, 411005, IndiaKetaki NaikDepartment of Information Technology, Bharati Vidyapeeth’s College of Engineering for Women, Pune, Maharashtra, 411043, IndiaManoj D. TambakheZokir MamadiyarovDepartment of Economics, Mamun University, Khiva, UzbekistanNavneet JoshiDepartment of Mathematics, Graphic Era Hill University, Bhimtal Campus, Uttarakhand, 263136, IndiaV. K. Chaitanya VarmaDepartment of Mechanical Engineering, Sagi Rama Krishnam Raju Engineering College, Chinamiram Rural, Andhra Pradesh, 534204, India
2026en
ABI

Annotatsiya

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.

Hali tarjima qilinmagan

Identifikatorlar

Iqtiboslar va manbalar

0 ta iqtibos0 ta foydalanilgan manba