The Intelligence Community, DOD, financial, and commercial entities rely on encryption to protect its most sensitive information. Public Key Encryption (PKE) method is used to encrypt information using the principle that it is difficult to factor a very large number into its primes unless one has access to a private key that was used to encrypt the information. Using this technology, decrypting a message using a 128-bit long key would take a classical supercomputer about 1 billion billion years to decrypt. However, in the mid-1990s, mathematicians Shor and Grover developed algorithms that have proved to be efficient in factoring large numbers into primes using a quantum computer. The development of quantum hardware and algorithms therefore threaten encryption protection. In 2019, Google announced that it established quantum supremacy, meaning that its quantum computer solved a problem that no classical computer could. The authors of this paper conducted a study to describe the latest encryption research and development, methods used, and the potential vulnerability due to quantum computing. The authors further established the timeframes in which pre-quantum encryption method will become vulnerable under three scenarios. All the research for this study was derived from unclassified open source materials.
The Intelligence Community, DOD, financial, and commercial entities rely on encryption to protect its most sensitive information. Public Key Encryption (PKE) method is used to encrypt information using the principle that it is difficult to factor a very large number into its primes unless one has access to a private key that was used to encrypt the information. Using this technology, decrypting a message using a 128-bit long key would take a classical supercomputer about 1 billion billion years to decrypt. However, in the mid-1990s, mathematicians Shor and Grover developed algorithms that have proved to be efficient in factoring large numbers into primes using a quantum computer. The development of quantum hardware and algorithms therefore threaten encryption protection. In 2019, Google announced that it established quantum supremacy, meaning that its quantum computer solved a problem that no classical computer could. The authors of this paper conducted a study to describe the latest encryption research and development, methods used, and the potential vulnerability due to quantum computing. The authors further established the timeframes in which pre-quantum encryption method will become vulnerable under three scenarios. All the research for this study was derived from unclassified open source materials.
Quantum computing is poised to revolutionize numerous fields, including cryptography. Traditional encryption algorithms that form the backbone of modern digital security, such as RSA and Elliptic Curve Cryptography (ECC), rely on computationally difficult problems—specifically, the factorization of large integers and the solving of discrete logarithms. However, quantum computers, leveraging the principles of quantum mechanics, present the potential to solve these problems in polynomial time through algorithms like Shor’s Algorithm, rendering these encryption methods insecure. The development of sufficiently powerful quantum computers could therefore undermine the confidentiality and integrity of sensitive digital information across the internet. This paper explores the threats posed by quantum computing to traditional cryptographic systems, with a focus on the impact of Shor’s Algorithm and Grover’s Algorithm. In addition, the paper reviews ongoing efforts to develop quantum-resistant cryptographic techniques, particularly in the area of post-quantum cryptography (PQC). It discusses the NIST Post-Quantum Cryptography Standardization project, the promising alternatives to current encryption schemes, and the potential for quantum key distribution (QKD) as a solution. The paper concludes with a reflection on the urgent need to prepare for quantum computing's eventual impact on digital security and the steps that can be taken to mitigate these risks in the transition to quantum-safe cryptography.
The development of quantum computing technologies represents a critical risk for virtually all classical encryption systems (RSA, AES, ECC) and cybersecurity will sustain immense damage. RSA and AES in total depend on modern cyber security as they use factoring and discrete logarithm problems whose solving is perilous via quantum algorithms like Shor’s and Grover’s. This study analyzes the impact of quantum computing on current encryption systems and the need for post-quantum cryptography (PQC). More precisely, its postgraduate level reads laced based cryptography and other quantum resistant algorithms as potential solutions. The paper also discusses other obstacles transitioning from classical encryption to PQC such as performance overhead, infrastructure deviation, and global standardization policies. Precedence finds and computational simulations expostulate the necessity for quantum safe encryptions and accentuated suggestions for further developments. These findings express the need for protection when quantum computing era becomes ubiquitous.
Information security is a fundamental and urgent issue in the digital transformation era. Cryptographic techniques and digital signatures have been applied to protect and authenticate relevant information. However, with the advent of quantum computers and quantum algorithms, classical cryptographic techniques have been in danger of collapsing because quantum computers can solve complex problems in polynomial time. Stemming from that risk, researchers worldwide have stepped up research on post-quantum algorithms to resist attack by quantum computers. In this review paper, we survey studies in recent years on post-quantum cryptography (PQC) and provide statistics on the number and content of publications, including a literature overview, detailed explanations of the most common methods so far, current implementation status, implementation comparisons, and discussion on future work. These studies focused on essential public cryptography techniques and digital signature schemes, and the US National Institute of Standards and Technology (NIST) launched a competition to select the best candidate for the expected standard. Recent studies have practically implemented the public key encryption/key encapsulation mechanism (PKE/KEM) and digital signature schemes on different hardware platforms and applied various optimization measures based on other criteria. Along with the increasing number of scientific publications, the recent trend of PQC research is increasingly evident and is the general trend in the cryptography industry. The movement opens up a promising avenue for researchers in public key cryptography and digital signatures, especially on algorithms selected by NIST.
As quantum computing emerges, the security domain is set to encounter unparalleled challenges, necessitating a pivotal shift to Post-Quantum Cryptography (PQC) for safeguarding against quantum adversities. Current cryptographic mechanisms, especially RSA and ECC, are susceptible to quantum breaches due to their reliance on factorization and discrete logarithm problems. The emergence of quantum computers endangers traditional cryptographic infrastructures, exposing them to swift decryption by algorithms like Shor’s, N=p⋅q, and Grover’s, r≡a2NmodN, where N is the product of two significant primes, p and q, and r denotes the remainder after applying Grover’s algorithm to a. Conventional cryptographic methods, which rest on problems solvable by quantum computers, emphasize the need to transition to PQC, substituting prevalent methods with quantum-resilient alternatives, represented by E=memodn, where E is the encrypted message, m the plaintext, e the public key exponent, and n the product of two prime numbers. This research evaluates the efficacy of PQC approaches, encompassing lattice-based, code-based, and isogeny-based cryptography, with assessments based on metrics like encryption duration, Te=fe1, and key length, log2(N), where Te represents encryption time and fe the encryption speed. Employing standardized datasets, we examine encryption and decryption speeds, key sizes, and success metrics against NIST’s endorsed security standards. The findings underscore PQC’s potential in delivering robust security, albeit with variations in performance metrics, guiding secure communication choices. In summation, the study highlights the essential shift to PQC in addressing the vulnerabilities ushered in by quantum computing, presenting a spectrum of fortified strategies for the future of information security.
Compared with electronic computers, quantum parallelism has led to a significant increase in the computing power of quantum computers.However, the computing power of quantum computers will also be limited by the laws of physics, and hence there is no doubt that the computing power of quantum computers is not unlimited.For an algorithm, we need to consider both its space complexity and time complexity.This not only requires quantum computers to achieve large-scale integration, but also requires the quantum coherence time to be sufficiently long.If either of the above two conditions is not met, the task cannot be completed.Shor's algorithm [1] reduced the computational complexity of large integer factorization to the polynomial level.This complexity is of the same order as that of the encryption and decryption for the RSA public key cryptography protocol, which leads to the insecurity of the RSA in universal quantum computing.In addition, some other quantum algorithms show different kinds of enhanced speeds for solving different problems, such as the Grover's search algorithm [2] and its improved works [ 3 , 4 ], and the HHL algorithm [5] .With the remarkable computational power of these quantum algorithms, physicists have begun to seek suitable physical systems for the implementation of quantum computing.The implementation of quantum computing includes several basic technologies, such as preparation, precise control, measurement of the physical qubits, and construction of logical qubits.At present, there are many experimental candidate quantum computing platforms, including the superconducting system [6] , trapped ions system [7] , nitrogenvacancy centers in diamonds [8] , and ultra-cold atoms [9] .Recently, Google experimentally demonstrated quantum supremacy with a superconducting quantum computer [10] , thus placing the research on quantum computing at the forefront.With the booming development of quantum computing technology, the public key cryptosystem also needs to be updated periodically.Thus, cryptographers have to constantly look for public key protocols to resist quantum computing attacks, which leads to the emergence of postquantum cryptography.It is worth noting that although the name of post-quantum cryptography contains the word 'quantum', it essentially consists of protocols of classical cryptography.The current research on post-quantum cryptography mainly includes protocols based on the following four frameworks: the protocols based on Hash function, the pro- * Corresponding author.
Cryptography is crucial for protecting private information. However, the emergence of quantum computing poses a significant threat to the security of classical cryptographic systems. Traditional algorithms such as RSA can be vulnerable to quantum attacks. Shor's quantum algorithm can break RSA encryption in polynomial time. This article examines the RSA cryptosystem, the impact of quantum computing on cryptography, the challenges of quantum computing, and its applications in various fields. The article also presents an experiment comparing traditional and Shor factorization methods for semi-prime numbers. Although the experiment does not involve factoring extremely large numbers, it demonstrates the simplicity of implementing algorithms. By conducting experiments and analysing the results, computer science students can better understand the principles of quantum computing, its capabilities, and limitations, and develop practical skills.