A Quantum Automatic Tool for Finding Impossible Differentials
Authors:
Preprint
Abstract
Due to the superiority of quantum computing, traditional cryptography is facing severe threat. This makes the security evaluation of cryptographic systems in quantum attack models significant and urgent. For symmetric ciphers, the security analysis heavily relies on cyptanalytic tools. Thus exploring the use of quantum algorithms to traditional cyptanalytic tools has drawn a lot of attention. In this study, we utilize quantum algorithms to improve impossible differential attack, and design two quantum automatic tools for searching impossible differentials. The proposed quantum algorithms exploit the idea of miss-in-the-middle and the properties of truncated differentials. We rigorously prove their validity and calculate the quantum resources required to implement them. Compared to existing classical automatic cryptanalysis, the quantum tools proposed have the advantage of accurately characterizing S-boxes while only requiring polynomial complexity, and can take into consideration the impact of the key schedules in single-key model.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- A Novel Automatic Technique Based on MILP to Search for Impossible Differentials2023
- Quantum Collision Attacks on AES-Like Hashing with Low Quantum Random Access Memories2020
- Finding Hash Collisions with Quantum Computers by Using Differential Trails with Smaller Probability than Birthday Bound2020
- Implementing Grover Oracles for Quantum Key Search on AES and LowMC2020
- On Quantum Related-Key Attacks on Iterated Even-Mansour Ciphers2017
- Breaking Symmetric Cryptosystems Using Quantum Period Finding2016
- Semantic Security and Indistinguishability in the Quantum World2016
- Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World2013
- Automatic Search of Truncated Impossible Differentials for Word-Oriented Block Ciphers2012
- Impossible Differential Cryptanalysis for Block Cipher Structures2003