Quantum computing in cryptography: Exploring vulnerabilities and countermeasures
DOI:
https://doi.org/10.35335/cit.Vol15.2023.625.pp206-213Keywords:
Cryptographic Vulnerabilities, Post-Quantum Cryptography, Quantum Algorithm Threats, Quantum Computing, RSA Encryption, RSA and ECC algorithmsAbstract
This research delves into the critical analysis of vulnerabilities arising from the advent of quantum computing in traditional cryptographic systems. Employing a newly developed mathematical formulation model, the study meticulously evaluates the susceptibility of classical encryption methods, exemplified by XYZ Bank's RSA and ECC algorithms, to quantum algorithms such as Shor's and Grover's. The assessment reveals pronounced vulnerabilities, particularly highlighting the high susceptibility of RSA encryption to quantum attacks, emphasizing the urgent need to fortify existing cryptographic systems. The research rigorously evaluates potential countermeasures, with Post-Quantum Cryptography (PQC) emerging as a promising solution, showcasing superior effectiveness in mitigating vulnerabilities posed by quantum algorithms. The strategic imperative for organizations to transition towards PQC or other post-quantum cryptographic standards is evident, signaling a paradigm shift towards resilient encryption methods resilient to the disruptive capabilities of quantum computing. The research underscores the significance of collaboration among industry stakeholders, continuous research endeavors, and proactive measures in adopting quantum-resistant cryptographic standards to fortify data security strategies against potential quantum threats in an ever-evolving technological landscape.
Downloads
References
S. Bhattacharya, “Cryptology and information security-past, present, and future role in society,” Int. J. Cryptogr. Inf. Secur., vol. 9, no. 1/2, pp. 13–36, 2019.
S. Ullah, J. Zheng, N. Din, M. T. Hussain, F. Ullah, and M. Yousaf, “Elliptic Curve Cryptography; Applications, challenges, recent advances, and future trends: A comprehensive survey,” Comput. Sci. Rev., vol. 47, p. 100530, 2023.
F. Mallouli, A. Hellal, N. S. Saeed, and F. A. Alzahrani, “A survey on cryptography: comparative study between RSA vs ECC algorithms, and RSA vs El-Gamal algorithms,” in 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom), IEEE, 2019, pp. 173–176.
V. Mavroeidis, K. Vishi, M. D. Zych, and A. Jøsang, “The impact of quantum computing on present cryptography,” arXiv Prepr. arXiv1804.00200, 2018.
M. Rosales, “Quantum computing and the threat to classical encryption methods.” Utica College, 2019.
A. Lele, Quantum technologies and military strategy. Springer, 2021.
B. T. M. Nwaokocha, “Shor’s Algorithm in Quantum Cryptography,” 2020.
Y. Aono et al., “The present and future of discrete logarithm problems on noisy quantum computers,” IEEE Trans. Quantum Eng., 2022.
P. Kumar and A. Kumar Bhatt, “Enhancing multi?tenancy security in the cloud computing using hybrid ECC?based data encryption approach,” IET Commun., vol. 14, no. 18, pp. 3212–3222, 2020.
D. Ott and C. Peikert, “Identifying research challenges in post quantum cryptography migration and cryptographic agility,” arXiv Prepr. arXiv1909.07353, 2019.
D. Chawla and P. S. Mehra, “A roadmap from classical cryptography to post-quantum resistant cryptography for 5G-enabled IoT: Challenges, opportunities and solutions,” Internet of Things, p. 100950, 2023.
T. M. Fernandez-Carames and P. Fraga-Lamas, “Towards post-quantum blockchain: A review on blockchain cryptography resistant to quantum computing attacks,” IEEE access, vol. 8, pp. 21091–21116, 2020.
C. Balamurugan, K. Singh, G. Ganesan, and M. Rajarajan, “Post-quantum and code-based cryptography—some prospective research directions,” Cryptography, vol. 5, no. 4, p. 38, 2021.
A. C. Onuora, C. E. Madubuike, A. O. Otiko, and J. N. Nworie, “Post-Quantum Cryptographic Algorithm: A systematic review of round-2 candidates,” Acad. Inf. Technol. Prof. AITP, 2020.
C. Balamurugan, K. Singh, G. Ganesan, and M. Rajarajan, “Code-based post-quantum cryptography,” 2021.
P. Thanalakshmi, A. Rishikhesh, J. Marion Marceline, G. P. Joshi, and W. Cho, “A Quantum-Resistant Blockchain System: A Comparative Analysis,” Mathematics, vol. 11, no. 18, p. 3947, 2023.
K. Fischer, I. Trummová, P. Gajland, Y. Acar, S. Fahl, and A. Sasse, “The Challenges of Bringing Cryptography from Research Papers to Products: Results from an Interview Study with Experts”.
D. De Roure and O. Santos, “NLP, the BB84 quantum cryptography protocol and the NIST-approved Quantum-Resistant Cryptographic Algorithms,” Authorea Prepr., 2023.
D. Rachmawati, M. A. Budiman, and R. S. Lubis, “A hybrid cryptosystem based on zig-zag algorithm and Rivest Shamir Adleman (RSA) algorithm,” in IOP Conference Series: Materials Science and Engineering, IOP Publishing, 2018, p. 12046.
H. T. Sihotang, S. Efendi, E. M. Zamzami, and H. Mawengkang, “Design and implementation of Rivest Shamir Adleman’s (RSA) cryptography algorithm in text file data security,” in Journal of Physics: Conference Series, IOP Publishing, 2020, p. 12042.
S. Venkatraman and A. Overmars, “New method of prime factorisation-based attacks on RSA Authentication in IoT,” Cryptography, vol. 3, no. 3, p. 20, 2019.
M. A. M. Isa, N. N. A. Rahmany, M. A. Asbullah, M. H. A. Sathar, and A. F. N. Rasedee, “On the insecurity of generalized (Rivest-Shamir-Adleman)-advance and adaptable cryptosystem,” in Journal of Physics: Conference Series, IOP Publishing, 2019, p. 12021.
I. Al_Barazanchi, S. A. Shawkat, M. H. Hameed, and K. S. L. Al-Badri, “Modified RSA-based algorithm: A double secure approach,” TELKOMNIKA (Telecommunication Comput. Electron. Control., vol. 17, no. 6, pp. 2818–2825, 2019.
C. A. Lara-Nino, A. Diaz-Perez, and M. Morales-Sandoval, “Elliptic curve lightweight cryptography: A survey,” IEEE Access, vol. 6, pp. 72514–72550, 2018.
D. Mahto and D. K. Yadav, “Performance Analysis of RSA and Elliptic Curve Cryptography.,” Int. J. Netw. Secur., vol. 20, no. 4, pp. 625–635, 2018.
M. Koppl et al., “Application of Cryptography Based on Elliptic Curves,” in 2021 2nd International Conference on Electronics, Communications and Information Technology (CECIT), IEEE, 2021, pp. 268–272.
N. A. Azam, I. Ullah, and U. Hayat, “A fast and secure public-key image encryption scheme based on Mordell elliptic curves,” Opt. Lasers Eng., vol. 137, p. 106371, 2021.
A. Verri Lucca, G. A. Mariano Sborz, V. R. Q. Leithardt, M. Beko, C. Albenes Zeferino, and W. D. Parreira, “A review of techniques for implementing elliptic curve point multiplication on hardware,” J. Sens. Actuator Networks, vol. 10, no. 1, p. 3, 2020.
C. Varma, “A study of the ecc, rsa and the diffie-hellman algorithms in network security,” in 2018 International Conference on Current Trends towards Converging Technologies (ICCTCT), IEEE, 2018, pp. 1–4.
N. J. G. Saho and E. C. Ezin, “Comparative study on the performance of elliptic curve cryptography algorithms with cryptography through RSA algorithm,” in CARI 2020-Colloque Africain sur la Recherche en Informatique et en Mathématiques Apliquées, 2020.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Deni Kurniawan, Lise Pujiastuti
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
