In recent years, some general cryptographic technologies have been widely used in network platforms related to the national economy and people’s livelihood, effectively curbing network security risks and maintaining the orderly operation and normal order of society. However, due to the fast development and considerable benefits of quantum computing, the classical cryptosystem faces serious security threats, so it is crucial to analyze and assess the anti-quantum computing ability of cryptographic algorithms under the quantum security model, to enhance or perfect the design defects of related algorithms. However, the current design and research of anti-quantum cryptography primarily focus on the cryptographic structure or working mode under the quantum security model, and there is a lack of quantum security analysis on instantiated cryptographic algorithms. This paper investigates the security of AES-OTR, one of the third-round algorithms in the CAESAR competition, under the Q2 model. The periodic functions of the associated data were constructed by forging the associated data according to the parallel and serial structure characteristics of the AES-OTR algorithm in processing the associated data, and the periodic functions of the associated data were constructed multiple times based on the Simon quantum algorithm. By using the collision pair, two collision forgery attacks on the AES-OTR algorithm can be successfully implemented, and the period s is obtained by solving with a probability close to 1. The attacks in this paper caused a significant threat to the security of the AES-OTR algorithm.
In recent years, some general cryptographic technologies have been widely used in network platforms related to the national economy and people’s livelihood, effectively curbing network security risks and maintaining the orderly operation and normal order of society. However, due to the fast development and considerable benefits of quantum computing, the classical cryptosystem faces serious security threats, so it is crucial to analyze and assess the anti-quantum computing ability of cryptographic algorithms under the quantum security model, to enhance or perfect the design defects of related algorithms. However, the current design and research of anti-quantum cryptography primarily focus on the cryptographic structure or working mode under the quantum security model, and there is a lack of quantum security analysis on instantiated cryptographic algorithms. This paper investigates the security of AES-OTR, one of the third-round algorithms in the CAESAR competition, under the Q2 model. The periodic functions of the associated data were constructed by forging the associated data according to the parallel and serial structure characteristics of the AES-OTR algorithm in processing the associated data, and the periodic functions of the associated data were constructed multiple times based on the Simon quantum algorithm. By using the collision pair, two collision forgery attacks on the AES-OTR algorithm can be successfully implemented, and the period s is obtained by solving with a probability close to 1. The attacks in this paper caused a significant threat to the security of the AES-OTR algorithm.
Classical forgery attacks against Offset Two-round (OTR) structures require some harsh conditions, such as some plaintext and ciphertext pairs need to be known, and the success probability is not too high. To solve these problems, a quantum forgery attack on OTR structure using Simon’s algorithm is proposed. The attacker intercepts the ciphertext-tag pair [Formula: see text] between the sender and receiver, while Simon’s algorithm is used to find the period of the tag generation function in OTR, then we can successfully forge new ciphertext [Formula: see text] ([Formula: see text]) for intercepted tag [Formula: see text]. For a variant of OTR structure (Prøst-OTR-Even-Mansour structure), a universal forgery attack, in which it is easy to generate the correct tag of any given message if the attacker is allowed to change a single block in it, is proposed. It first obtains the secret parameter [Formula: see text] using Simon’s algorithm, then the secret parameter [Formula: see text] is used to find the keys [Formula: see text] and [Formula: see text], so that an attacker can forge the changed messages. It only needs several plaintext blocks to help obtain the keys to forge any messages. Performance analysis shows that the query complexity of our attack is [Formula: see text], and its success probability is very close to 1.
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.
Data security faces unprecedented challenges due to the rapid advancement of quantum computing technologies, which threaten to compromise foundational classical cryptographic algorithms. This study investigates the quantum implementation of a Double Advanced Encryption Standard (Double AES) scheme for generating secure, tamper-resistant Quick Response (QR) codes. The research encompasses architectural design, quantum circuit construction, and empirical performance evaluation across encryption/decryption execution times, resource allocation, and circuit error rates. Furthermore, we evaluate the vulnerability of the scheme against quantum cryptanalysis by modeling Grover’s search algorithm to estimate key recovery costs in terms of gate counts and qubit requirements. While classical implementations maintain speed advantages on conventional hardware, our findings demonstrate that quantum Double AES yields enhanced resilience against key-search attacks, offering a scalable post-quantum safeguard for visual data carrier architectures.
Contemporary cryptographic algorithms are resistant to the strongest threats to cybersecurity and high-profile cyber-attacks. In recent times, information security scientists and researchers had developed various cryptographic schemes that defeated attacks using the most sophisticated (in terms of processor speed) classical computer. However, this resistance will soon erode with the arrival of quantum computers. In this paper, we profiled quantum computers and quantum algorithms based on their widely believed threat against currently secure cryptographic primitives. We found that Grover’s and Shor’s quantum-based algorithms actually pose a threat to the continued security of symmetric cryptosystems (e.g. 128-bit AES) and asymmetric (public key) cryptosystems (e.g. RSA, Elgamal, elliptic curve Diffie Hellman (ECDH), etc.) respectively.We discovered that the source of the algorithms’ cryptanalytic power against the current systems, stems from the fact that they (Grover and Shor) both equipped their respective algorithms with a quantum circuit component that can execute the oracle in parallel by applying a single circuit to all possible states of an n-qubit input. With this exponential level of processing characteristic of quantum computers and quantum-based algorithms, it is easy for the current cryptosystems to be broken since the algorithms can existentially solve the underlying mathematical problems such as integer factorization, discrete logarithm problem and elliptic curve problem, which formed the basis of the security of the affected cryptosystems. Based on this realization and as part of our readiness for a post quantum era, we explored other mathematical structures (lattices, hashes, codes, isogenies, high entropy-based symmetric key resistance, and multivariate quadratic problems) whose hardness could surpass the cryptanalytic nightmare posed by quantum computers and quantum-based algorithms. Our contribution is that, based on the findings of this research work, we can confidently assert that all hope is not lost for organizations heavily relying on protocols and applications like HTTPS, TLS, PGP, Bitcoin, etc., which derived their security from the endangered cryptosystems.
Cryptography, the practice of concealing messages for private exchange, has evolved significantly to address the challenges posed by new communication methods. In today`s digital world, cryptography has become the cornerstone of cybersecurity, using advanced mathematics like number theory and computational complexity to protect digital information through algorithms. The upcoming arrival of quantum computers poses a serious threat to traditional cryptographic methods, especially those based on asymmetric key cryptography. Quantum Safe Cryptography (QSC) represents the next step in information security, designed to develop cryptographic systems that can withstand attacks from both quantum and classical computers. As quantum computing moves from theory to reality, it`s becoming clear that current cryptographic methods based on integer factorization and discrete logarithm problems are vulnerable to quantum algorithms like Shor`s algorithm. This study highlights the security risks that quantum computing poses to existing encryption methods and proposes a comprehensive approach to quantum-safe cryptography. The transition to quantum-resistant algorithms involves replacing vulnerable cryptographic systems with alternatives that can resist quantum computational attacks. Current analysis shows that while asymmetric key cryptography faces immediate vulnerability, symmetric key algorithms and hash functions remain relatively secure in the near term with appropriate adjustments. Quantum cryptography, which directly uses quantum mechanical principles, offers highly secure encryption mechanisms, notably Quantum Key Distribution (QKD). This research aims to enhance the security of digital infrastructure against quantum threats by evaluating hybrid cryptographic implementations that combine classical and quantum-resistant approaches for optimal security.
Abstract Due to its innovative and performance advantages, Prøst‐COPA and Prøst‐OTR have attracted widespread attention. For the Prøst‐COPA without associated data and with associated data, the corresponding quantum key recovery attacks are proposed using Simon's algorithm, respectively. In the first scenario, the messages are used to calculate the Message Authentication Code (MAC) and construct a period function to recover the secret parameter . Then, utilizing ciphertext, a periodic function is constructed with a periodic value equal to the key value. MAC is calculated from messages and the associated data in the second scenario. Considering the impact of the associated data on the periodicity of the function, the messages are treated as a constant and further construct two periodic functions to recover the secret parameter and the key. For Prøst‐OTR, by constructing two periodic functions using two tags with different numbers of message blocks, the secret parameter can be recovered, and then the key can be recovered using Simon's algorithm. Compared to the classical attacks, the quantum‐based methods only require quantum queries (where is the message block size), resulting in an exponential speed acceleration and the success probability of the method is close to 1. These methods also show a lower query complexity than the state‐of‐the‐art quantum methods.