In December 2022, an article was published on the implementation of the Shore algorithm in China on a quantum computer, where a 48-bit number was factorized and a prediction was made about the possibility of decomposing the RSA-2048 number using a similar technique. In this article, based on the experimental results presented in it, some conclusions are drawn about the possibility of practical use of the Shor algorithm and similar algorithms on quantum computers for attacks on information security systems based on solving integer factorization and discrete logarithm problems. The question of the dependence of the accuracy of calculations on the number of qubits in the system used and the depth of the program (the number of consecutive quantum operations on a quantum system) is considered. A brief overview of the history of the emergence and development of quantum key distribution technology, as well as other crypto protocols based on the physical properties of switching networks, is presented. A comparison is made with similar technologies in digital cryptography. In some cases, the advantage of the latter is shown in their ease of use, performance and provable durability.
In December 2022, an article was published on the implementation of the Shore algorithm in China on a quantum computer, where a 48-bit number was factorized and a prediction was made about the possibility of decomposing the RSA-2048 number using a similar technique. In this article, based on the experimental results presented in it, some conclusions are drawn about the possibility of practical use of the Shor algorithm and similar algorithms on quantum computers for attacks on information security systems based on solving integer factorization and discrete logarithm problems. The question of the dependence of the accuracy of calculations on the number of qubits in the system used and the depth of the program (the number of consecutive quantum operations on a quantum system) is considered. A brief overview of the history of the emergence and development of quantum key distribution technology, as well as other crypto protocols based on the physical properties of switching networks, is presented. A comparison is made with similar technologies in digital cryptography. In some cases, the advantage of the latter is shown in their ease of use, performance and provable durability.
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.
Quantum computing is a big change in the way computers work, and it promises to be much faster than traditional systems. This new technology brings both huge benefits and huge problems, especially when it comes to cryptographic security measures. Classical encryption algorithms, like RSA and ECC, depend on the fact that some math problems are hard, like discrete logarithms and integer factorization. Quantum algorithms, like Shor's algorithm, can solve these problems quickly. Because of this, the development of scalable quantum computers poses a danger to the basic safety of the cryptography methods that are widely used today. This short summary looks at the big effects that quantum computing will have on the safety of cryptography. It looks at the security holes that quantum algorithms create and stresses how important it is to find answers for post-quantum cryptography (PQC). PQC wants to make programs that can't be broken by quantum attacks. This will make sure that digital interactions can still be private, secure, and real in a world powered by quantum computers. Also, switching to PQC comes with a lot of problems, such as implementing algorithms, making sure they are all the same, and getting people to use them in a lot of different technology environments. The abstract talks about current research projects and foreign partnerships that aim to standardize and implement PQC. It stresses how important it is to plan ahead to reduce the risks of the future.
The fast-evolving field of quantum computing provides a lot of computational advantages in its efficiency in solving problems, however, the emergence of quantum computing presents a double-edged sword for cybersecurity. This paper aims to examine the effects of quantum algorithms, specifically Shor’s algorithm, on the security of public-key cryptography, such as Rivest-Shamir-Adleman (RSA). An examination of the Shor’s algorithm showed its capability to solve discrete logarithm and factorization problems much faster than classical computers, undermining the foundational structure of modern-day cryptographic protocols. The implications of quantum search algorithms, such as Grover’s algorithm, have also been explored alongside their influence on symmetric-key cryptography and hash functions. Furthermore, this study investigates the potential vulnerabilities in digital signature schemes and key-exchange protocols, exposing the strengths and weaknesses of current cryptographic methods in the face of quantum algorithms and highlighting the urgent need for robust quantum-resistant alternatives. Approximately 70% of literature reviewed emphasizes the critical vulnerability of existing cryptographic schemes to quantum algorithms. In conclusion, the vulnerabilities exposed by quantum algorithms necessitate a rapid switch to Post-Quantum Cryptography (PCQ) to safeguard digital infrastructure. The development of quantum-resistant solutions is critical for ensuring long-term cryptographic security in the face of the impending risks posed by quantum algorithms.
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.
Quantum computing can be regarded as a disruptive enabling technology that can pose a threat to traditional cryptography as it invented new approaches to encrypt data. This paper will compare the level of security that accompanies quantum algorithms as well as the level of efficiency. Specifically, we examine the impact of efficient quantum computing on traditional cryptography and propose techniques against quantum invasions. Four quantum algorithms are analyzed for their efficiency and security benefits in the post-quantum era: Grover’s Algorithm, Shor’s Algorithm, The Quantum Key Distribution (QKD), Lattice-based cryptography. The results reveal that Grover’s algorithm improves search time complexity from O(n) to O(√n), which is advantageous over large data sets. As it will be clear shortly, Shor’s algorithm challenges RSA encryption because it outperforms classical algorithms in factoring large integers. QKD presents secure key exchange protocols that cannot be breached notwithstanding the attempts made using quantum computing. Lattice-based schemes are quantum-resistant alternatives based on the security of certain hard mathematical problems. Based on our experimental results, computational efficiency can be improved, but new cryptographic systems will have to be developed for the mitigation of quantum-related vulnerabilities. This research shows the importance of quantum-resistant cryptographic techniques to ensure data security in the emerging quantum computing era.
Today we witness an explosive growth in attention to Q-computing. Q-computing technologies, along with artificial intelligence (AI) and machine learning (ML) technologies, cloud and foggy computing, as well as technologies for collecting and streaming processing of Big Data and ETL, are constantly leading the lists of ""end-to-end"" information technologies for the digital economy of technologically developed countries of the world. One of the main reasons for this is the potential ability of quantum computers to solve some computational problems more efficiently than any of the most modern classical computers of the von Neumann architecture (supercomputers). The most expressive and interesting, from an applied point of view, examples of such problems are integer factorization, effectively performed by Shor's quantum algorithm, as well as record search in an unordered database, effectively solved by Grover's algorithm. This monograph contains the best practice for solving problems of quantum cryptanalysis to improve cyber security and resilience of the digital economy. The book discusses well-known and author's software implementations of promising quantum Shor algorithms, Grover, Simon et al. Shor's algorithm provides exponential acceleration of solving factorization problems, discrete logarithm problems (DLPs) and elliptic curve discrete logarithm problems (ECDLPs). The mentioned tasks are widely used in TLS, SSH or IPsec cryptographic applications of Internet/Intranet and IIoT/IoT networks, communication protocols based on Diffie–Hellman key agreements (dependent on the strength of the DLP or ECDLP), digital signature algorithms (DSA, ECDSA, RSA-PSS), public key encryption algorithms (El Gamal, RSA-OAEP), etc. In other words, Shor's quantum algorithm is potentially capable of violating these algorithms, and with them all the mechanisms of public-key cryptography deployed in cyberspace.