IEEE Spectrum

5 Questions: Scott Best: Prepping Today's Systems for Tomorrow's Post-Quantum Cryptography

Rahul Rao

Published Jul 1, 2024• 0 citations

Abstract

Today's cryptographic protocols rely on mathematical techniques like finding the prime factors of very large numbers. But large enough quantum computers would have a powerful tool called Shor's algorithm, which can quickly factor colossal integers.

DOI: 10.1109/mspec.2024.10589686

Related papers

Quantum-resistant End-to-End Secure Messaging and Email Communication

Christoph Döberl, Wolfgang Eibner, Simon Gärtner +3 more

With recent advances on the capabilities of quantum computers and the seminal work by Shor on the prime factorization of integers with quantum algorithms, the threat of quantum computers is looming over public-key based cryptographic systems. Two distinct areas of research – post-quantum and quantum cryptography – provide the technical means to secure cryptographic systems against potentially powerful enough quantum computers. As both technologies are now becoming readily available, integration in a wide range of applications to understand their characteristics and trade-offs and the associated evaluation is of importance.

International Conference on Availability, Reliability and Security (ARES)Aug 9, 202312 citations

Exploring Shor's Algorithm in Cracking RSA Encryption

Aashutosh Srivastava

The present study explores the groundbreaking possibilities of Shor's algorithm in cracking RSA encryption, hence enhancing the security consequences of this extensively employed cryptographic protocol. Due to Shor's algorithm's exponential speed advantage over classical algorithms, RSA encryption—a popular public key cryptosystem—is vulnerable to quantum attacks. To keep its security, RSA depends on the difficulty of factoring huge semi-primes. RSA's security presumptions are called into question by Shor's algorithm's quick factorization on a quantum computer, which has prompted research into post-quantum cryptography solutions to guarantee secure communication in the quantum age. Even with parallel computation, the speed and storage capacity of classical computing are constrained. A key idea in quantum computing is quantum parallelism, which allows quantum systems to carry out several computations at once. In contrast to classical portions. The scope of this paper is to understand the fundamentals of Quantum Computing, the current state of Shor’s algorithm implementation, and efficiency, particularly its application in compromising public key cryptosystems like RSA. The project aims to achieve how factorization is done through classical methods and further, how is this done through Shor’s algorithm and QFT techniques.

International Journal of Sciences: Basic and Applied ResearchNov 15, 20240 citations

Implementation and Analysis of Shor's Algorithm to Break RSA Cryptosystem Security

Siyon Singh, Eric Sakk

The ongoing development of Quantum Computing (QC) is a breakthrough paradigm that holds the power to revolutionize the way we process information and solve complex problems today. Quantum Computation works on the fundamental principles of Superposition and Entanglement, enabling Quantum Computers to Leverage the power of Physics in Computing. QC has the potential to revolutionize fields such as Drug Development, Financial Modeling, Optimization, and Cryptography. Shor’s algorithm, a quantum algorithm used to factorize large numbers, poses significant threats to RSA, a widely used public key cryptosystem. RSA relies on the difficulty of factoring large semi-primes to keep its security. Shor's algorithm's ability to factorize quickly on a quantum computer undermines RSA's security assumptions, necessitating the exploration of post-quantum cryptographic solutions to ensure secure communication in the quantum era. The goal of this paper is to assess the present state of Shor's algorithm implementation and efficiency, specifically its application in the context of compromising public key cryptosystems like RSA.

Dec 14, 20231 citation

Implementation and Analysis of Shor's Algorithm to Break RSA Cryptosystem Security

Siyon Singh, Eric Sakk

Jan 8, 202411 citations

Modeling One-way and Two-way quantum key distribution protocols

Ahmed Mahmoud Sofy, Mohamed Ahmed Shalaby, Hisham Dahshan +1 more

The present cryptography systems security depends on the hardness of factorizing an integer number with a large number of digits to its prime integer factors. In 1994, Peter Shor proposed a quantum procedure (Shor's algorithm) that easily factorizes large integer numbers to its prime factors compared with other algorithms. Consequently, present cryptography systems became endangered and once quantum computers exist, conventional cryptography systems could breakdown. On the other hand, quantum cryptography security is based on the well-known quantum mechanics uncertainty principle, and so the quantum cryptography enhances the cryptography field with a mechanism for eavesdropper detecting. Here, a hardware implementation was proposed for two types of key distribution protocols based on quantum computing, the one-way quantum key distribution protocol (BB84 protocol), and the two-way quantum key distribution protocol.

International Conference on Intelligent Computing and Information Systems (ICICIS)Dec 1, 20193 citations

Factorization in Cybersecurity: a Dual Role of Defense and Vulnerability in the Age of Quantum Computing

Himateja Arukala

One of the most critical components of modern cryptography and thus cybersecurity is the ability to factor large integers quickly and efficiently. RSA encryption, one of the most used types, is based largely on the assumption that factoring for large numbers is computationally infeasible for humans and computers alike. However, with quantum computers, people can use an algorithm like Shor’s algorithm to perform the same task exponentially faster than any normal device ever could. This investigation will go into the strength and vulnerability of RSA encryption using the power of factorization in an age of quantum computers.We start by looking at the foundations of both classical and quantum factoring with greater detail at number field sieve (NFS) and Shor’s. We examine the mathematical background of each topic and the associated algorithms. We conclude with theoretical analysis and experimental simulations that address the difficulty and implications of the above-mentioned algorithms in cryptography. The final thing that I will be discussing is where quantum computing is at present and how this could pose a threat to the current type of cryptographic systems, we use every day. I will be mentioning how we need post-quantum cryptography and how people are currently creating algorithms that are designed to be attack-resistant even to large-scale quantum computers. This investigation has shown the changing dynamics of cybersecurity in the quantum era and helps us understand the challenges and the need to innovate the current cryptographic systems.

Mar 25, 20242 citations