The advancement in the field of technology and science has rendered the classical algorithms used for securing data vulnerable to attacks by quantum computers. Post quantum cryptography aims at establishing quantum safe algorithms so that data can be secured. Advanced Encryption Standard (AES) is a symmetric key block cipher which provides security against known quantum attacks. The Shor’s and Grover’s algorithms are the quantum algorithms which have proved to break encryption provided by security mechanisms like RSA and even have the potential to break AES-128 in future. However, if key size of symmetric key security mechanisms is increased then security provided by them cannot be broken by both classical and quantum computers in near future. Quantum computers are becoming more and more prevalent, but there is still some concern about their security. In this paper, we will show that the current quantum computers in use cannot break AES-256 encryption with Grover’s algorithm. We have implemented AES-256 for encryption of files in our system and proposed a proof that the qubits used by quantum computers are not enough to break AES-256 with Grover’s algorithm. We believe that this provides strong evidence that current quantum computers are not a threat to encrypted data using AES-256. We hope this will ease concerns about using quantum computing for secure applications and encourage further development of these powerful machines.
The advancement in the field of technology and science has rendered the classical algorithms used for securing data vulnerable to attacks by quantum computers. Post quantum cryptography aims at establishing quantum safe algorithms so that data can be secured. Advanced Encryption Standard (AES) is a symmetric key block cipher which provides security against known quantum attacks. The Shor’s and Grover’s algorithms are the quantum algorithms which have proved to break encryption provided by security mechanisms like RSA and even have the potential to break AES-128 in future. However, if key size of symmetric key security mechanisms is increased then security provided by them cannot be broken by both classical and quantum computers in near future. Quantum computers are becoming more and more prevalent, but there is still some concern about their security. In this paper, we will show that the current quantum computers in use cannot break AES-256 encryption with Grover’s algorithm. We have implemented AES-256 for encryption of files in our system and proposed a proof that the qubits used by quantum computers are not enough to break AES-256 with Grover’s algorithm. We believe that this provides strong evidence that current quantum computers are not a threat to encrypted data using AES-256. We hope this will ease concerns about using quantum computing for secure applications and encourage further development of these powerful machines.
This paper investigates the potential impact of quantum computing on the security of currently deployed cryptographic algorithms. The core premise is that the advent of powerful quantum computers, leveraging algorithms like Shor's algorithm and Grover's algorithm, poses a significant threat to widely used public-key cryptosystems and symmetric-key algorithms. We present a theoretical analysis of several key algorithms – RSA, ECC, and AES – examining their vulnerabilities when subjected to quantum attacks. Specifically, we explore the exponential speedup offered by Shor's algorithm for factoring large numbers, the impact on the key size of ECC, and the Grover's algorithm's influence on symmetric key search. Our work highlights the urgency of transitioning to post-quantum cryptography standards to mitigate the risks posed by this technological advancement. The goal is to provide a comprehensive understanding of the landscape of quantum cryptanalysis and its implications for the future of secure communication.
The advent of quantum computing presents a paradigm shift in the field of cryptanalysis, challenging the security of classical encryption schemes that underpin modern digital communications. This study explores the capabilities of quantum algorithms, particularly Shor's algorithm and Grover's algorithm, in undermining widely used cryptographic systems. Shor's algorithm poses a direct threat to publickey cryptosystems such as RSA and ECC by enabling efficient integer factorization and discrete logarithm computation, which are computationally infeasible for classical computers. Meanwhile, Grover's algorithm provides a quadratic speedup for bruteforce attacks on symmetric-key cryptosystems like AES, significantly reducing their effective security. Through theoretical analysis and simulation-based evaluation, this paper highlights the vulnerabilities of classical encryption in the face of quantum advances and underscores the urgent need for post-quantum cryptographic solutions. The findings emphasize the critical importance of transitioning to quantum-resistant algorithms to ensure long-term data confidentiality in a future dominated by quantum technologies.
Quantum computing is currently being researched in many countries, and if implemented in the near future, it may pose a threat to existing encryption standards. In the quantum computer environment, asymmetric encryption can be solved by Shor’s Algorithm in polynomial time, and the difficulty of breaking symmetric encryption using brute force is reduced from N times to square root N times by Grover’s Algorithm. We take the Advanced Encryption Standard as the theme and increase the key length from the original standard 192 bits and 256 bits to 384 bits and 512 bits, respectively, in order to maintain the security level of AES 192/256 under the environment of quantum computing, so we propose the key schedule of AES 384/512, and write the software in C++ on FPGA. The experimental results show that our scheme can achieve Level III and Level V security levels in a quantum computer attack environment. In addition to increasing the length of the key, we use the LUT method in the process of writing SubBytes to replace the array and speed up the computation to optimize the execution speed. In addition, the proposed scheme is still based on 128-bit computing blocks, rather than computing blocks in larger blocks.
Abstract It is viewed as revolutionary technology, offering incredible potential in terms of computing power within different scientific and industrial sectors. Quantum computers provide remarkable computing power; however, they also present significant security risks to existing public-key cryptography systems used to secure digital communication, online banking systems, government, medical applications, cloud computing systems, and IoT systems. Security of commonly used encryption schemes like RSA, DH, and ECC depends on mathematical problems that are impossible for classical computers to solve but can be easily resolved with the help of powerful enough quantum computers by using Shor’s algorithm. Furthermore, Grover’s algorithm makes exhaustive search attacks much faster, thus effectively lowering the security level of symmetric encryption schemes since it provides the speed-up for brute-force attacks. Post-Quantum Cryptography (PQC) turned out to be an effective and scalable method to protect digital data from attacks using quantum computing. In contrast to quantum cryptography, which requires a special quantum communication channel, PQC uses classical cryptographic algorithms that cannot be broken down by either classical or quantum computer due to certain mathematical problems. This research paper offers an extensive exploration of post-quantum cryptography through the analysis of the development of quantum computing, weaknesses of current cryptographic techniques, and mathematics behind quantum-resistant algorithms. Moreover, this paper explores the major classes of PQC techniques such as lattice-based, code-based, hash-based, multivariate, and isogeny-based cryptography and provides details about their security and application. Moreover, the report gives an overview of the NIST Post-Quantum Cryptography Standardization Project and analyzes recent standardizations of quantum-proof algorithms to be utilized in future digital infrastructures. Keywords: Post-Quantum Encryption, Quantum Security, Quantum-Proof Public-Key Cryptography, Lattice-Based Security Protocols, ML-KEM Key Encapsulation Mechanism, ML-DSA Digital Signature Algorithm, NIST Post-Quantum Cryptography, Contemporary Cybersecurity, Secure Communications, Cryptographic Algorithms.
Quantum computing poses a significant threat to classical cryptographic algorithms, particularly the Advanced Encryption Standard (AES). This study investigates the impact of Grover's algorithm on the AES S-box, a fundamental component of the AES encryption process. By leveraging quantum mechanics, Grover's algorithm can potentially reduce the time required to break AES encryption from 2128operations to 264operations, thus presenting a substantial security risk. This research aims to evaluate the feasibility of such quantum attacks on AES S-box by conducting experiments using virtual quantum simulators. The study examines the resource requirements, including the number of gates and qubits, and assesses the scalability of Grover's algorithm across different data sizes and types. The findings indicate that, while theoretically effective, the practical implementation of Grover's algorithm is currently hindered by significant resource constraints on existing quantum hardware. These results underscore the need for continued advancements in quantum technology and the development of quantum-resistant cryptographic methods to ensure data security in the quantum era. This research contributes to the understanding of quantum vulnerabilities in classical cryptography and supports the development of robust encryption strategies that can withstand future quantum attacks.
A coming great revolution in technology is quantum computing, which opens new attacks on most of the developed cryptographic algorithms, including AES. These emerging quantum capabilities risk weakening cryptographic techniques, which safeguard a vast amount of data across the globe. This research uses Grover's algorithm to explore the vulnerabilities of the Advanced Encryption Standard to quantum attacks. By implementing quantum cryptographic algorithms and Quantum Error Correction on simulators and quantum hardware, the study evaluates the effectiveness of these techniques in mitigating noise and improving the reliability of quantum computations. The study shows that while AES is theoretically at risk due to Grover’s algorithm, which demonstrates a theoretical reduction in AES key search complexity, current hardware limitations and noise levels encountered in today’s quantum computers reduce the immediate threat and limit practical exploitation. The research also examines NTRU encryption, a quantum-resistant alternative, highlighting its robustness in quantum environments. The findings emphasize the need for further development in QEC and quantum-resistant cryptography to secure digital communications against future quantum threats. Future work will focus on advancing QEC techniques and refining quantum algorithms, addressing both hardware and theoretical advancements, including the potential use of high-capacity processors like Jiuzhang 3.0. These improvements will ensure the scalability of quantum-resistant systems to practical key sizes and usage scenarios.