Quantum graph theoretic encryption and dynamic key evolution in secure quantum communication networks

Verma, Vivek Kumar; Saini, Bhavna; Jain, Tarun; Dadheech, Pankaj

doi:10.47974/JDMSC-1908

Open Access Research Article

Quantum graph theoretic encryption and dynamic key evolution in secure quantum communication networks

Vivek Kumar Vermavermavivek123@gmail.comDepartment of Information TechnologyManipal University JaipurJaipur, Rajasthan, IndiaView full profile → , Bhavna Sainibhavnasaini10@gmail.comDepartment of Data Science & AnalyticsCentral University RajasthanIndiaView full profile → , ^*Tarun JainCorresponding authortarunjainjain02@gmail.comDepartment of Computer Science & EngineeringManipal University JaipurJaipur, Rajasthan, IndiaView full profile → , Pankaj Dadheechpankajdadheech777@gmail.comDepartment of Computer Science & EngineeringSwami Keshvanand Institute of Technology, Management & GramothanJaipur, Rajasthan, IndiaView full profile →

* Corresponding author · click or hover a name for details

pp. 525–536Vol. 27Issue 2-AMarch 2024DOI: 10.47974/JDMSC-1908 Crossmark XML

Published Online:: 06 Apr 2024
Article type:: Research Article
Language:: EN
Article no.:: JDMSC-1908
Pages:: 525–536

Abstract

The dawn of the quantum era marks a pivotal moment in the evolution of digital communications, bringing forth both unparalleled potential and unprecedented challenges. This paper delves into the realm of Quantum Graph Theoretic Encryption and Dynamic Key Evolution, a frontier in the quest for impenetrable communication networks in the quantum computing age. Quantum computing, with its ability to perform complex calculations at speeds unattainable by traditional computers, offers a beacon of hope and a source of peril. The very principles that endow quantum computers with exceptional power also render traditional cryptographic methods vulnerable. This dichotomy underscores the urgency for innovative encryption techniques that can withstand the onslaught of quantum computational capabilities. When merged with the principles of quantum mechanics, graph theory opens a new dimension of cryptographic possibilities. However, the dynamic nature of digital communications necessitates more than just robust encryption; it requires agility. This is where the concept of Dynamic Key Evolution comes into play. This paper is structured to guide the reader through this novel integration of quantum mechanics, graph theory, and dynamic cryptography. We begin by laying a foundational understanding of quantum computing, followed by an exploration of graph theory in the context of encryption. We then introduce our proposed method of Quantum Graph Theoretic Encryption, highlighting its advantages and potential applications. Subsequently, we delve into the concept of Dynamic Key Evolution, illustrating its significance in maintaining the integrity of quantum encryption in a rapidly changing digital landscape.

Keywords

Quantum-resilient encryption Quantum error correction Quantum mechanics in cryptography Hybrid cryptographic systems Entropic uncertainty principle

Subject Classifications

81P94

References

[1] Zhou, Hongyi, et al. “Quantum network: security assessment and key management.” IEEE/ACM Transactions on Networking 30.3, 1328-1339, (2022).
[2] Alshowkan, Muneer, et al. “Advanced architectures for high-performance quantum networking.” Journal of Optical Communications and Networking 14.6 : 493-499 (2022).
[3] Sharma, Sandeep Kumar, Kumar, Anil, Ashtagi, Rashmi & Jain, Rekha. OCA: An intelligent model for improving security breach of biometric based authentication systems, Journal of Discrete Mathematical Sciences and Cryptography, 26:5, 1415–1425 (2023), DOI: 10.47974/JDMSC-1765.
[4] Ugwuishiwu, C. H., et al. “An overview of quantum cryptography and shor’s algorithm.” Int. J. Adv. Trends Comput. Sci. Eng 9.5 (2020).
[5] Ferrara, R., Bassoli, R., Deppe, C., Fitzek, F. H., & Boche, H., The computational and latency advantage of quantum communication networks. IEEE Communications Magazine, 59(6), 132-137 (2021).
[6] Sandeep Kumar Sharma, Anil Kumar, and Uday Pratap Singh. Enhanced Edges Detection from Different Color Space. In Proceedings of the 4th International Conference on Information Management & Machine Intelligence (ICIMMI ‘22). Association for Computing Machinery, New York, NY, USA, Article 16, 1–6 (2023).
[7] Alhayani, Bilal A., et al. “Design of quantum communication protocols in quantum cryptography.” Wireless Personal Communications : 1-18 (2023).
[8] Sharma, Vijay Kumar, et al. “Secret image scrambling and DWT-based image steganography using smoothing operation and convolution neural networks.” (2020).
[9] Anil Kumar & Sandeep Kumar Sharma. Information cryptography using cellular automata and digital image processing, Journal of Discrete Mathematical Sciences and Cryptography, 25:4, 1105-1111 (2022), DOI: 10.1080/09720529.2022.2072437.
[10] Talapula, Dharani Kumar, et al. “A novel intrusion detection system in cloud infrastructure using deep learning technique.” Journal of Discrete Mathematical Sciences and Cryptography 26.5 : 1277 (2023).
[11] Pius, Anu, and D. R. Kirubaharan. “An Effective Analysis of Cryptography and Importance of Implementing Cryptography in Fuzzy Graph Theory.” Proceedings of International Conference on Communication and Artificial Intelligence: ICCAI 2021. Singapore: Springer Nature Singapore, (2022).
[12] Valerio Scarani, Helle Bechmann-Pasquinucci, Nicolas J. Cerf, Miloslav Dušek, Norbert Lütkenhaus, Momtchil Peev, “The security of practical quantum key distribution,” Reviews of Modern Physics, Vol. 81, pp. 1301-1350, (2009).
[13] Artur Ekert, Renato Renner, “The ultimate physical limits of privacy,” Nature, Vol. 507, pp. 443-447, (2014).
[14] Austin G. Fowler, Matteo Mariantoni, John M. Martinis, Andrew N. Cleland, “Surface codes: Towards practical large-scale quantum computation,” Physical Review A, Vol. 86, 032324, (2012).
[15] László Babai, “Graph Isomorphism in Quasipolynomial Time,” arXiv:1512.03547 [cs.DS], (2016).
[16] Daniel A. Spielman, Shang-Hua Teng, “A Local Clustering Algorithm for Massive Graphs and its Application to Nearly-Linear Time Graph Partitioning,” SIAM Journal on Computing, Vol. 42, No. 1, pp. 1-26, (2013).
[17] Norio Konno, “Quantum Walks,” in Quantum Potential Theory, Uwe Franz, Michael Schürmann (Eds.), Lecture Notes in Mathematics, Springer, Vol. 1954, pp. 309-452, (2008).

Views: 263Downloads: 118Citations: 0