Conventional cyber security, especially public key cryptosystems depend upon the difficulty of solving large integer factorization and discrete log problems. The most straightforward way to solve these problems is to try all possible keys, which would be far too difficult for conventional computers. But the speed in which quantum computing is growing has posed a great threat to the conventional cryptosystems. This paper reviews how conventional public key cryptosystems might crumble under quantum computing and the need for quantum – safe cryptography.
Conventional cyber security, especially public key cryptosystems depend upon the difficulty of solving large integer factorization and discrete log problems. The most straightforward way to solve these problems is to try all possible keys, which would be far too difficult for conventional computers. But the speed in which quantum computing is growing has posed a great threat to the conventional cryptosystems. This paper reviews how conventional public key cryptosystems might crumble under quantum computing and the need for quantum – safe cryptography.
Quantum computing poses a significant threat to conventional cryptographic systems that rely on the difficulty of mathematical problems such as integer factorization and discrete logarithms. These systems underpin much of the current security infrastructure, including public key cryptography and digital signatures. As quantum computers approach practical viability, there is an urgent need to transition to quantum-resistant cryptographic solutions that can secure digital communications against adversaries equipped with quantum capabilities. This paper explores the landscape of quantum-resistant cryptography, focusing on those algorithms that have emerged either as standards or as leading algorithm. Furthermore, the paper examines the progress of standardization efforts, such as the National Institute of Standards and Technology (NIST) Post-Quantum Cryptography (PQC) initiative, and the implications of deploying these algorithms in existing systems. By addressing the practical considerations for adoption, this study aims to provide a comprehensive overview of the current state and future directions of quantum-resistant cryptography, ensuring robust security in a post-quantum world.
The defense of public key cryptography (PKC) lies in computational issues like the difficulty of factorizing enormous prime numbers and the discrete logarithm calculations. Such kinds of algorithms are called one-way functions because although it is straightforward to compute output given input, it is difficult to compute input if output is given. It is expected that such numerical or computational issues which are utilized in current cryptographic plans are difficult to address for an adversary utilizing present PCs. Yet, many organizations are attempting to assemble a high-powered quantum PC and in the future quantum PCs will be available for business use. Traditional asymmetric cryptographic algorithms are not secure against strong quantum machines. Shor’s algorithm running on a powerful quantum PC is able to solve integer factorization problems and discrete logarithm problems in polynomial time. So, asymmetric algorithms that are used today, like RSA, DSA and Diffie-Hellman will become insecure. Similarly, Grover’s algorithm running on a powerful quantum computer poses a serious threat to symmetric key algorithms which uses small key size. There is a need to work on alternate algorithms to resist quantum threat. NIST has already started with a process for the standardization of algorithms which are known as post-quantum cryptography (PQC) algorithms. Specialists globally are exploring progress toward post-quantum cryptography.
The paper proposes strategic steps that organizations can take to future-proof their security architecture against quantum threats for the security of data integrity and confidentiality in the post-quantum era. it is a very threat that quantum computing is advancing too fast, and the classical cryptographic systems will be in danger. Therefore, we need to modify the methods of cryptography in Quantum- Safe Cryptography. In this paper, we focus on exposing the vulnerabilities of existing public-key cryptosystems faced with quantum attacks and the direction of the post-quantum cryptographic (PQC) algorithm in securing the underlain infrastructure. The paper discusses ongoing efforts to standardize cryptosystems led by the National Institute of Standards and Technology (NIST). It overviews several quantum-resistant cryptographic techniques: lattice-based, hash-based, and code-based examples. Moreover, the paper also outlines difficulties in implementing quantum-safe cryptography solutions into currently in-place cybersecurity frameworks, especially in the finance, healthcare, and critical infrastructure industries.
Quantum computers with the ability to solve difficult mathematical problems exponentially faster pose an immediate danger to conventional encryption procedures, which are currently thought to be secure in the world of classical computing. This paper explores the fundamental effects of quantum computing on cryptography, showing how quantum algorithms, like Shor's algorithm, may effectively factor big numbers and solve discrete logarithm issues, making popular encryption techniques susceptible. The study looks into how susceptible traditional encryption methods like RSA and ECC are to quantum assaults, highlighting how urgent it is to switch to quantum-resistant cryptographic solutions. This paper also presents an overview of quantum-resistant cryptographic algorithms currently being developed, and investigates quantum key distribution (QKD) protocols as a viable countermeasure. This study highlights the urgent requirement for a proactive strategy in creating quantum-safe cryptographic standards by examining the difficulties presented by quantum computing and assessing the possible directions in post-quantum cryptography. The results underline the need for a united effort from academics, business leaders, and governments to lessen the imminent threat posed by quantum computers and safeguard the integrity and security of digital communication in the future.
Contemporary cryptographic algorithms are resistant to the strongest threats to cybersecurity and high-profile cyber-attacks. In recent times, information security scientists and researchers had developed various cryptographic schemes that defeated attacks using the most sophisticated (in terms of processor speed) classical computer. However, this resistance will soon erode with the arrival of quantum computers. In this paper, we profiled quantum computers and quantum algorithms based on their widely believed threat against currently secure cryptographic primitives. We found that Grover’s and Shor’s quantum-based algorithms actually pose a threat to the continued security of symmetric cryptosystems (e.g. 128-bit AES) and asymmetric (public key) cryptosystems (e.g. RSA, Elgamal, elliptic curve Diffie Hellman (ECDH), etc.) respectively.We discovered that the source of the algorithms’ cryptanalytic power against the current systems, stems from the fact that they (Grover and Shor) both equipped their respective algorithms with a quantum circuit component that can execute the oracle in parallel by applying a single circuit to all possible states of an n-qubit input. With this exponential level of processing characteristic of quantum computers and quantum-based algorithms, it is easy for the current cryptosystems to be broken since the algorithms can existentially solve the underlying mathematical problems such as integer factorization, discrete logarithm problem and elliptic curve problem, which formed the basis of the security of the affected cryptosystems. Based on this realization and as part of our readiness for a post quantum era, we explored other mathematical structures (lattices, hashes, codes, isogenies, high entropy-based symmetric key resistance, and multivariate quadratic problems) whose hardness could surpass the cryptanalytic nightmare posed by quantum computers and quantum-based algorithms. Our contribution is that, based on the findings of this research work, we can confidently assert that all hope is not lost for organizations heavily relying on protocols and applications like HTTPS, TLS, PGP, Bitcoin, etc., which derived their security from the endangered cryptosystems.
The paper proposes strategic steps that organizations can take to future-proof their security architecture against quantum threats for the security of data integrity and confidentiality in the post-quantum era. it is a very threat that quantum computing is advancing too fast, and the classical cryptographic systems will be in danger. Therefore, we need to modify the methods of cryptography in Quantum-Safe Cryptography. In this paper, we focus on exposing the vulnerabilities of existing public-key cryptosystems faced with quantum attacks and the direction of the post-quantum cryptographic (PQC) algorithm in securing the underlain infrastructure. The paper discusses ongoing efforts to standardize cryptosystems led by the National Institute of Standards and Technology (NIST). It overviews several quantum-resistant cryptographic techniques: lattice-based, hash-based, and code-based examples. Moreover, the paper also outlines difficulties in implementing quantum-safe cryptography solutions into currently in-place cybersecurity frameworks, especially in the finance, healthcare, and critical infrastructure industries.