Impacts of Quantum Computing on Cryptographic Algorithms: Challenges and the Future of Cybersecurity

Authors

  • Lerato Mthembu Mangosuthu University of Technology, Department of Information Technology, South Africa Author
  • Austin Smith Cape Peninsula University of Technology, School of ICT, Cape Town, South Africa Author

Abstract

The advent of quantum computing represents a paradigm shift in the field of computation, with profound implications for various industries. In the realm of cybersecurity, quantum computing poses a dual-edged sword: while it has the potential to enhance encryption techniques, it also threatens to render many current cryptographic algorithms obsolete. This paper explores the impact of quantum computing on cryptographic algorithms, focusing on the challenges posed by quantum-enabled attacks and their implications for cybersecurity. With the development of algorithms like Shor's algorithm, traditional cryptographic protocols such as RSA and ECC, which rely on the computational infeasibility of factoring large integers and solving discrete logarithm problems, are at significant risk. On the other hand, quantum-resistant cryptographic algorithms, commonly known as post-quantum cryptography, have emerged as a promising solution. This paper examines the challenges in transitioning to quantum-resistant cryptographic systems, including implementation hurdles, resource constraints, and standardization. Furthermore, it delves into the broader implications of quantum computing for cybersecurity frameworks, highlighting how organizations can prepare for the quantum era. By investigating both the risks and opportunities presented by quantum computing, this paper emphasizes the necessity for a proactive approach to safeguard sensitive data in the post-quantum world.

Downloads

Published

2024-12-07

How to Cite

Impacts of Quantum Computing on Cryptographic Algorithms: Challenges and the Future of Cybersecurity. (2024). Global Research Perspectives on Cybersecurity Governance, Policy, and Management, 8(12), 12-23. http://hammingate.com/index.php/GRPCGPM/article/view/2