Abstract Quantum algorithm uses the quantum parallel method to calculate, which can better solve the encryption and decryption problems in cryptography and secure communication. This paper proposeS a quantum pairwise-parallel mismatch attack on Kyber using the quantum binary search method. We first give quantum search methods for finding the secret key and show that our method can be applied to Kyber. Then, According to the proposed quantum search method, we compute the number of queries required and computational complexity for recovering the full key on Kyber. Compared with the existing results, our improved attack significantly reduces the number of queries and computational complexity.
Abstract Quantum algorithm uses the quantum parallel method to calculate, which can better solve the encryption and decryption problems in cryptography and secure communication. This paper proposeS a quantum pairwise-parallel mismatch attack on Kyber using the quantum binary search method. We first give quantum search methods for finding the secret key and show that our method can be applied to Kyber. Then, According to the proposed quantum search method, we compute the number of queries required and computational complexity for recovering the full key on Kyber. Compared with the existing results, our improved attack significantly reduces the number of queries and computational complexity.
Recently, American National Institute of Standards and Technology (NIST) announced Kyber as the first KEM candidate to be standardized. The security of Kyber is based on the modular learning with errors (MLWE) problem, which achieves excellent efficiency and size. This work proposes an improved key mismatch on Kyber, which can reduce the number of queries required to recover the secret key. We first transform the problem of finding a certain parameter of ciphertexts into a quantum ordered search problem. Then we give the procedure of finding the value of a parameter in the ciphertexts by the quantum method. Finally, we instantiate this attack method on Kyber512, Kyber768 and Kyber1024. Compared with the existing attack algorithm, our improved attack reduces the number of queries for Kyber512, Kyber768 and Kyber1024 by 63%, 59% and 45%, respectively.
Abstract In order to solve the issue that traditional secure remote password (SRP) protocols cannot resist the active quantum computing attack, a simple and efficient SRP protocol based on post quantum algorithm Kyber named KSRP is proposed. In the protocol, the asymmetrical key consensus algorithm (AKCN) and post quantum algorithm are used to implement authenticated key exchange. This scheme can resist password recovery, Denning-Sacco’s attack and other attacks after being analyzed, which satisfies provable security under eCK model and indistinguishable game model. Compared with the traditional password authenticated key exchange (PAKE) protocols based on classical hard mathematical problems, this protocol refers to the generation method on the temporary public key and private key in the post quantum public key encryption algorithm Kyber, which enhances the security of process parameters. In addition, the scheme uses compression functions for the transmitted session public key to reduce communication overhead and improve security. After being tested in the LWE tester tool SageMathCell, the security of this protocol can reach 313 bits, which is 2.79 times the traditional SRP protocol, and 3.91 times J-PAKE protocol, also is higher 70.1% than Ding’s RLWE-PAK and RLWE-PPK protocols. The communication overhead in the protocol is only higher about 16% of post-quantum PPK and PAK protocols. This protocol is simple, efficient, and resistant to quantum computing active attacks, which can be applied in remote authenticated key exchange in cloud networks.
The fact that modern cryptographic systems are susceptible to a significant attack from quantum computing which solves complex mathematical problem exponentially faster than the classical scheme of computers makes the present situation a dangerous one. Legacy encryption methods including RSA, ECC, and AES that are the heart of secure communication are especially susceptible to quantum attacks such as Shor’s and Grover’s algorithms. To mitigate this potential threat, this research puts forth state of the art quantum-resistant technologies inclusive of lattice based cryptography and hash based signature solutions. The Lattice-Hash Hybrid method that is proposed, improves security by exploiting the computational intractability of lattice problems and the collision resistance of the hash functions, making it very hard to crack the system using quantum decryption algorithms. In the study, a comparative analysis of the proposed method with traditional lattice-based, hash-based and code-based cryptographic methods is performed. Experimental results suggest that the proposed algorithm features better encryption speed, decreased decryption latency, and increased security level as compared with the current state of the art. The results emphasize the need for the implementation of cutting edge electronic cryptography strategies to protect integrity and confidentiality of data in the days to come within the context of quantum computing. Further research will concentrate on optimizing the proposed techniques further and bringing them to real-world deployment.
Cryptography is very essential in our daily life, not only for confidentiality of information, but also for information integrity verification, non-repudiation, authentication, and other aspects. In modern society, cryptography is widely used; everything from personal life to national security is inseparable from it. With the emergence of quantum computing, traditional encryption methods are at risk of being cracked. People are beginning to explore methods for defending against quantum computer attacks. Among the methods currently developed, quantum key distribution is a technology that uses the principles of quantum mechanics to distribute keys. Post-quantum encryption algorithms are encryption methods that rely on mathematical challenges that quantum computers cannot solve quickly to ensure security. In this study, an integrated review of post-quantum encryption algorithms is conducted from the perspective of traditional cryptography. First, the concept and development background of post-quantum encryption are introduced. Then, the post-quantum encryption algorithm Kyber is studied. Finally, the achievements, difficulties and outstanding problems in this emerging field are summarized, and some predictions for the future are made.
Quantum computing poses a threat to modern encryption algorithms such as Rivest-Shamir-Adleman (RSA) and Elliptic Curve Cryptography (ECC) with the Shor’s algorithm, cutting cracking time from millions of years to just days. Attackers commonly use an attack known as “Store Now, Decrypt Later”. This form of attack banks on the future of quantum computing. Many post-quantum algorithms have been created to counteract the imminent attack should data leak. CRYSTALS-Kyber is one of the most secure post quantum algorithms that has been approved by the NIST. Using the CRYSTALS-Kyber as a base for a cryptographic scheme, a security framework can be developed with encryption and sessions in mind. Keeping virtual sessions as limited as possible reduces the number of openings an attacker may have to attempt to steal data. Despite the quantum threat, it is likely that a robust system is designed to prevent an attack from the present and a future threat. The system proposed will integrate session key managers along with strong encryption to ensure attackers cannot easily store the data now, nor will the data that they steal be easily cracked.
Secure communication is becoming increasingly challenging as computational power grows, cyberattacks evolve, and traditional cryptographic methods show their limitations. Widely used public-key algorithms like RSA and ECC, which have protected digital communication for decades, are now vulnerable in the face of advancing quantum computing. Quantum algorithms such as Shor's algorithm can break these classical systems, posing a serious threat to data that needs long-term protection. This growing risk has led to the development of post-quantum cryptography, a new generation of algorithms designed to remain secure against both classical and quantum attacks. Among the different approaches, lattice-based cryptography stands out due to its strong security foundations and efficient performance. In this work, we implement a post-quantum cryptographic method using the CRYSTALS-Kyber algorithm on Raspberry Pi devices. By using two Raspberry Pi modules to securely exchange keys and perform text encryption and decryption, the project demonstrates that quantum-resistant communication can be achieved even on low-cost embedded hardware.