<![CDATA[As technology continues to evolve, cybersecurity measures tend to be vulnerable to the computational power of quantum computers. These computers perform calculations faster than classical computers. This ability to solve tasks within polynomial time threatens current cybersecurity practices through Shor's and Grover's algorithms. Classical computers rely on mathematical hardness assumptions and are vulnerable to quantum attacks. This paper scrutinizes the double effects of quantum computing on cybersecurity and its ability to support post-quantum resistant technologies. A systematic literature review (SLR) of 24 peer-reviewed articles (2021-2025) obtained from IEEE Xplore, SpringerLink, ACM, and Google Scholar was conducted, and the results identified three integral themes. Firstly, 80% of quantum computing threats studies analysed prove that Shor's algorithm can efficiently factorise large integers, rendering Rivest Shamir Alderman and Elliptic Curve Cryptography obsolete. Secondly, 65% of the studies show that Post-Quantum Cryptography (PQC) offers quantum-resilience in the foreseeable future. In comparison, 25% of Quantum Key Distribution (QKD) papers show practical barriers like signal loss and standardization delays. 15% of studies reveal the urgent need for regulatory and ethical concerns. Key results highlight the urgent need for hybrid cryptographic systems that combine quantum key distribution and post-quantum cryptography, as proposed by 40% of recent publications. 46% of studies show that Europe leads quantum cybersecurity research, driven by collaborative policy efforts. This study suggests practical recommendations for accelerated adoption of NIST-standardised PQC algorithms, investment in QKD infrastructure for critical sectors, and multidisciplinary collaboration to address technical, legal, and ethical gaps. This paper provides a roadmap for mitigating quantum threats and leveraging quantum technologies to transform cybersecurity resilience in the digital era.]]>
Copyrights © 2025
