Recent developments in quantum cryptography have started affecting security and privacy of modern classical cryptography. Just in 1994, Peter Shor represented algorithm for factoring large prime numbers which forced cryptographers and security experts to give attention to quantum cryptography. Modern classical Public Key Infrastructures depends on difficulty of factoring large prime numbers using RSA. Shor's algorithm challenges this and makes jeopardy of modern PKI. For example, when we try to break 2048 bit RSA key using classical computers it will take billion years to break. But same can be broken within few seconds with mature quantum computing architecture. Having said this, quantum computers have their own limitations. They are having small memories, limited processing power and works on comparatively smaller distances. In this paper we discusses quantum cryptography and limitation of classical and quantum cryptography in providing privacy.
Recent developments in quantum cryptography have started affecting security and privacy of modern classical cryptography. Just in 1994, Peter Shor represented algorithm for factoring large prime numbers which forced cryptographers and security experts to give attention to quantum cryptography. Modern classical Public Key Infrastructures depends on difficulty of factoring large prime numbers using RSA. Shor's algorithm challenges this and makes jeopardy of modern PKI. For example, when we try to break 2048 bit RSA key using classical computers it will take billion years to break. But same can be broken within few seconds with mature quantum computing architecture. Having said this, quantum computers have their own limitations. They are having small memories, limited processing power and works on comparatively smaller distances. In this paper we discusses quantum cryptography and limitation of classical and quantum cryptography in providing privacy.
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.
This dissertation analyzes the impact of quantum computing on the security of classical cryptographic systems, with a focus on the vulnerability of the RSA algorithm. RSA cryptography is based on the difficulty of factoring large prime numbers, a task considered computationally very difficulty for classical computers. However, with quantum computing, especially through Shor’s algorithm—this barrier can be overcome. Shor’s algorithm allows factorization in polynomial time, which would completely compromise the security of RSA.The dissertation presents the theoretical foundations of both cryptography and quantum computing, explaining key concepts such as qubits, superposition, entanglement, and quantum parallelism. It details the operation of Shor’s algorithm, from identifying the period of the modular exponential function to applying the Quantum Fourier Transform (QFT) and phase estimation to obtain the prime factors of a composite number.In addition to the theoretical component, the work includes practical implementations of the algorithm in both classical and simulated quantum environments, using IBM’s Qiskit library. Finally, it discusses post-quantum cryptography as a secure alternative in light of technological advancements, highlighting methods based on lattices, codes, hash functions, and multivariate systems.The conclusion emphasizes the urgency of adopting cryptographic systems resistant to quantum computing, as ongoing advances increasingly make the breaking of RSA a realistic threat. Post-quantum cryptography is mentioned as a necessary response to the challenge posed by quantum computing.In conclusion, although current quantum computers do not yet have sufficient power to break RSA in practice, technological progress is steadily bringing that scenario closer. Therefore, it is essential to develop and adopt quantum-resistant cryptographic systems to ensure information security in the coming decades.
In recent years Quantum Cryptography gets more attention as well as becomes most promising cryptographic field for faster, effective and more secure communications. Quantum Cryptography is an art of science which overlap quantum properties of light under quantum mechanics on cryptographic task instead of current state of algorithms based on mathematical computing technology. Major algorithms for public key encryption and some digital signature scheme such as RSA, El Gamal cryptosystem, hash function are vulnerable at quantum adversaries. Most of the factoring problem can be broken by Shore's algorithm and quantum computer threatens other hand discrete logarithm problem. Our paper describes why modern cryptography contributes quantum cryptography, security issues and future goals of modern cryptography.
Cryptography has long been an essential tool in safeguarding digital communication and securing sensitive information. As technology has progressed, so has the complexity of the methods used to protect our data. In the wake of quantum computing's rise, traditional cryptographic systems face serious challenges, demanding a new understanding of how quantum algorithms could both undermine and enhance security. Chapter 1 deals with the Basics of Cryptography lays the groundwork by introducing classical cryptography, tracing its evolution from ancient ciphers to modern cryptosystems. In Chapter 2, readers are introduced to Quantum Algorithms, the principles of quantum mechanics relevant to computing, including qubits, superposition, and entanglement. The Chapter 3 focuses on Shor’s algorithm, a landmark quantum algorithm that threatens the security of widely used public-key cryptosystems like RSA and ECC. In Chapter 4 Grover’s Algorithm is examined in the context of brute-force attacks on symmetric key cryptography. Chapter 5 focusing on Simon’s Algorithm and its role in breaking cryptographic primitives through structure exploitation. In Chapter 6 a broader discussion about Cryptographic Implications of Quantum Computing is given on how quantum computing affects modern cryptographic systems. Finally, in Chapter 7, the future of cryptography in the quantum era is discussed.
The security of messages encoded via the widely used RSA public key encryption system rests on the enormous computational effort required to find the prime factors of a large number N using classical (conventional) computers. In 1994 Peter Shor showed that for sufficiently large N, a quantum computer could perform the factoring with much less computational effort. This paper endeavors to explain, in a fashion comprehensible to the nonexpert, the RSA encryption protocol; the various quantum computer manipulations constituting the Shor algorithm; how the Shor algorithm performs the factoring; and the precise sense in which a quantum computer employing Shor’s algorithm can be said to accomplish the factoring of very large numbers with less computational effort than a classical computer. It is made apparent that factoring N generally requires many successive runs of the algorithm. Our analysis reveals that the probability of achieving a successful factorization on a single run is about twice as large as commonly quoted in the literature.
This abstract discusses the transformational capacity of Shor’s Algorithm and quantum cryptography in quantum computing. However, Shor’s Algorithm poses a problem to classical cryptographic systems such as RSA encryption because of its apparent capacity to multiply speed the integer factorization. This approach relies on multimillions qubit quantum computers with systematic error correction which have yet to be implemented. Quantum cryptography revolutionizes secure communication via Quantum Key Distribution (QKD). It uses quantum mechanics to design the unbreakable key exchange system that can identify eavesdropping. Despite the prospect, quantum cryptography is hampered by limits in distances and speeds of QKD transmission. Quantum repeaters and satellite-based QKD make it possible to overcome these difficulties and facilitate the creation of a secure global communication grid. The comparison of classical and quantum cryptography illustrates an evolution from complexity-based security to quantum physics security, which is immune to quantum computational attacks. Reports of quantum supremacy and QKD network development are stages on the way towards quantum computers and cryptography. Technology challenges on this approach include scalability of quantum systems, qubit coherence, and error correction. Quantum computing has the potential to transform computer and communication security. This route involves innovation in quantum technology development, as well as integration issues. Quantum computing and cryptography’s full potential would lead to an age of new computational possibilities that will change the encryption of data and secure communication.