Quantum computing is a computational paradigm that leverages quantum-mechanical principles such as superposition and entanglement to solve problems significantly faster than classical computers (NIST, 2022). While quantum computing promises breakthroughs in medicine, logistics, and artificial intelligence, it also threatens the foundation of modern security. Algorithms such as RSA and ECC, which are widely used in banking, e-commerce, and government systems, will become obsolete once quantum computers mature (The Times, 2024). Q Secure is a conceptual framework designed to help financial institutions transition to post-quantum cryptography (PQC) and safeguard sensitive customer data from emerging quantum threats. Developed for the AIS SCLC 2025 Post-Quantum Computing Security Challenge, Q Secure won 1st place amongst 20+ teams with a prize of $2,000. Our project tackled the critical question: How can organizations proactively adapt to a world where current encryption methods will no longer be secure?
Quantum computing is a computational paradigm that leverages quantum-mechanical principles such as superposition and entanglement to solve problems significantly faster than classical computers (NIST, 2022). While quantum computing promises breakthroughs in medicine, logistics, and artificial intelligence, it also threatens the foundation of modern security. Algorithms such as RSA and ECC, which are widely used in banking, e-commerce, and government systems, will become obsolete once quantum computers mature (The Times, 2024). Q Secure is a conceptual framework designed to help financial institutions transition to post-quantum cryptography (PQC) and safeguard sensitive customer data from emerging quantum threats. Developed for the AIS SCLC 2025 Post-Quantum Computing Security Challenge, Q Secure won 1st place amongst 20+ teams with a prize of $2,000. Our project tackled the critical question: How can organizations proactively adapt to a world where current encryption methods will no longer be secure?
Quantum computing, a transformative leap in computational science, is rapidly emerging as a disruptive force capable of reshaping the foundational pillars of cybersecurity and cryptography. Unlike classical computing, which relies on binary states, quantum computing utilizes quantum bits (qubits), leveraging the principles of superposition, entanglement, and quantum tunneling to perform complex calculations at unprecedented speeds. This paradigm shift poses a dual-edged impact on the field of cybersecurity: it offers unparalleled potential for advancing secure communication through quantum cryptographic protocols such as Quantum Key Distribution (QKD), while simultaneously threatening the integrity of classical encryption methods like RSA and ECC, which could be rendered obsolete by quantum algorithms like Shor's and Grover's. This paper explores the current state of quantum computing, its implications for existing cryptographic infrastructures, and the urgent need for post-quantum cryptography (PQC) standards. It also examines governmental and institutional responses to the quantum threat, including NIST's ongoing PQC standardization efforts, and the development of hybrid cryptographic models that combine quantumresistant algorithms with classical security measures. Furthermore, the study discusses ethical considerations, regulatory challenges, and the importance of global cooperation in transitioning to a quantum-secure digital future. As quantum technology progresses from theoretical frameworks to practical applications, cybersecurity must evolve in tandem to address both its promises and perils.
With the arrival of fault-tolerant quantum computers, an existential threat has come to the cryptographic underpinnings of the security infrastructure in place for modern information technologies. Virtually all secure digital communication protocols used today are based on classical public-key cryptographic systems – RSA, Elliptic Curve Cryptography (ECC) and Diffie-Hellman key exchange – that are susceptible to polynomial-time quantum attacks using Shor's algorithm. Symmetric cryptographic algorithms that are not broken are being effectively halved by Grover's algorithm, for example, AES. In this article, a complete and journal-standard systematic review of quantum computing and its implications in the field of information technology security is presented which includes 22 peer-reviewed publications from 2023-2025. The study covers the basics of quantum computing (qubits, superposition, entanglement and quantum gates), and how quantum computing specifically poses a threat to classical cryptography via algorithmic mechanisms. The three post-quantum cryptographic algorithms that were standardised by the National Institute of Standards and Technology (NIST) in August 2024 (ML-KEM, FIPS 203; ML-DSA, FIPS 204; and SLH-DSA, FIPS 205) are compared based on their security assumptions, performance, and readiness for deployment. The practical limitations and the use of Quantum Key Distribution, (QKD), as a physics based alternative to the computational security assumptions are discussed. Results show that although mature PQ solutions are now available for most cryptographic applications, the migration challenge, including legacy system transitions, migration architecture, and governance, is significant and pressing as the ‘harvest now, decrypt later’ threat model is relevant and adversaries might be collecting encrypted data for quantum decryption. The impact for financial services, health care, government, cloud infrastructure and critical national infrastructure is discussed. Lastly, the researchers list key research areas: standardisation of quantum-safe protocols, hybrid PQC-QKD designs, light-weight PQC for constrained devices, and quantum-safe blockchain.
Quantum computing’s arrival signals a paradigm shift in computational power that may transform several sectors, including drug discovery, artificial intelligence, materials research, and optimization [2]. However, this transformative potential also presents a significant and imminent threat to cybersecurity. At the heart of this technological shift is the ability of quantum computers to tackle the complex mathematical challenges on which modern public-key cryptography relies. Quantum algorithms, most notably Shor’s algorithm, can break problems such as integer factorization and discrete logarithms far more efficiently than classical approaches. As a result, cryptographic methods that are widely trusted today—including RSA and Elliptic Curve Cryptography (ECC)—could become insecure once large-scale quantum computing becomes a reality[1], [8].This poses a profound challenge to the confidentiality, integrity, and authenticity of digital communications, financial networks, essential infrastructure, and national defense systems [9]. To counter this emerging risk, Post-Quantum Cryptography (PQC) has become an important area of active research. The goal of PQC is to design cryptographic techniques that can withstand attacks from both conventional computers and future quantum systems, thereby preserving long-term data security in the face of advancing quantum technologies [3].A number of promising Post-Quantum Cryptography (PQC) approaches are currently being explored in depth. Among them, lattice-based cryptography has attracted significant interest, as it relies on the computational difficulty of problems like Learning With Errors (LWE) and the Shortest Vector Problem (SVP), offering both robust security assurances and practical efficiency [4], [5]. Hash-based signature schemes, such as XMSS and SPHINCS+, offer security rooted in well-established hashing techniques and stateless signature construction [7]. Additionally, code-based cryptography, including systems inspired by the McEliece cryptosystem, remains attractive for its long-standing resistance to cryptanalytic attacks [6]. Other avenues include multivariate quadratic systems and isogeny-based cryptography, each presenting unique benefits and trade-offs in terms of key size, performance, and security robustness [8].A central force driving global standardization is the NIST Post-Quantum Cryptography Standardization Project, initiated in 2016 to evaluate and establish new quantum-resilient cryptographic standards [3]. Several algorithms have already advanced to the final standardization phase, while others remain candidates for further evaluation.Despite this progress, transitioning to PQC introduces practical challenges. Integrating new cryptographic algorithms into current digital ecosystems demands considerable computational and infrastructural updates, often involving larger key sizes and increased processing overhead [10]. Organizations must also ensure crypto-agility, the capability to rapidly adapt cryptographic systems as new standards evolve or vulnerabilities are identified [11].One strategic transition approach involves hybrid cryptographic architectures, which combine conventional and quantum-safe algorithms to provide layered security during this migration period [9]. Moreover, organizations should inventory existing cryptographic assets, conduct quantum risk assessments, pilot PQC deployments, and cultivate a quantum-aware cybersecurity workforce.The threat is amplified by “harvest now, decrypt later” strategies, in which adversaries intercept encrypted data today with the intention of decrypting it once quantum capabilities mature [9]. Particularly sensitive categories — including military communications, governmental archives, personal healthcare records, and intellectual property — require immediate PQC-oriented protection.As the quantum era approaches, coordinated global action is essential to harness quantum innovation while safeguarding digital trust. Through proactive investment in research, standardization efforts, and phased post-quantum deployment, societies can preserve digital sovereignty and security resilience in the face of this technological shift [11].
The accelerating development of quantum computing represents one of the most significant paradigm shifts in the history of information security. Cryptographic systems that currently underpin global digital infrastructure—including RSA, Diffie–Hellman, and Elliptic Curve Cryptography—rely on mathematical assumptions that collapse under quantum algorithms such as Shor’s and Grover’s. Post-Quantum Cryptography (PQC) emerges as the most viable and immediate solution to secure communications in the quantum era, offering cryptographic primitives that can be deployed on today’s classical hardware while resisting both classical and quantum attacks. This review provides a comprehensive, detailed examination of PQC, analyzing its mathematical foundations, algorithmic families, standardization progress, and deployment challenges. Special emphasis is placed on the NIST PQC standardization process, the risk posed by “harvest-now-decrypt-later” adversaries, the complexities of global cryptographic migration, and the implications for critical digital infrastructures such as cloud computing, blockchain systems, long-lifespan data archives, IoT ecosystems, and national cybersecurity. Through standalone equations, tables, and figures—including a conceptual visual provided by the user—this paper offers a complete, cohesive, and rigorous synthesis. The findings underscore that the transition to PQC is not optional but imperative, requiring coordinated scientific, governmental, and industrial effort to safeguard the digital future.
The rapid advancement of quantum computing poses both transformative opportunities and profound challenges for modern cybersecurity and cryptography. Unlike classical computers, quantum systems leverage the principles of quantum mechanics-superposition, entanglement, and quantum tunneling-to process information in fundamentally new ways, enabling exponentially faster computation for certain problems. This paradigm shift threatens to render many of today's widely adopted cryptographic algorithms obsolete, particularly those relying on the hardness of integer factorization (e.g., RSA) and discrete logarithms (e.g., ECC and DSA). Quantum algorithms, such as Shor's algorithm, have the potential to break these cryptosystems in polynomial time, exposing sensitive data to unprecedented levels of vulnerability. Additionally, Grover's algorithm accelerates brute-force attacks on symmetric encryption schemes, reducing their effective security strength by half. This paper explores the implications of quantum computing on current cryptographic infrastructures, highlighting the urgency for transitioning to quantum-resistant or postquantum cryptographic algorithms. It examines emerging standards from bodies such as NIST, which are fostering the development and evaluation of lattice-based, codebased, multivariate polynomial, and hash-based cryptographic solutions. Furthermore, the study delves into the dual-edged nature of quantum computing in cybersecuritydiscussing its potential not only as a threat but also as a powerful tool for enhancing security through quantum key distribution (QKD), quantum random number generation, and other quantum-enhanced protocols. The work concludes by evaluating the readiness of current systems for the "quantum threat," identifying gaps in awareness, infrastructure, and policy, and proposing a strategic roadmap for a secure transition into the post-quantum era. As the quantum revolution accelerates, understanding and preparing for its cybersecurity ramifications is not merely a technical necessity but a cornerstone of global digital resilience.
The advent of quantum computing has brought both excitement and apprehension across scientific and technological domains. Unlike classical computers, which operate using binary states (0s and 1s), quantum computers leverage the principles of superposition and entanglement to perform calculations at unparalleled speeds. This capability enables quantum systems to tackle problems previously deemed computationally infeasible. While this breakthrough has far-reaching applications in areas such as material science, artificial intelligence, and optimization, it poses a significant threat to modern cryptographic systems. Quantum computing introduces unprecedented computational capabilities that challenge the very foundation of modern cryptographic systems. Traditional encryption techniques, such as RSA and ECC, are particularly vulnerable to quantum algorithms like Shor's, which can solve problems in polynomial time that classical computers find infeasible. This paper delves into quantum-resistant cryptographic techniques, particularly lattice-based cryptography and multivariate polynomial schemes, as sustainable alternatives. The research analyzes the advancements in quantum hardware, evaluates current vulnerabilities, and proposes a hybrid cryptographic framework for secure communication in a post-quantum era. By combining theoretical exploration with practical simulations, the study offers insights into building resilient cryptographic systems that ensure longterm data security in the quantum era.