Author
Listed:
- Huiqin Xie
(Department of Cryptography Science and Technology, Beijing Electronic Science and Technology Institute, Beijing 100070, China
Key Laboratory of Cryptography of Zhejiang Province, Hangzhou Normal University, Hangzhou 311121, China)
- Qiqing Xia
(Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100085, China
School of Cyber Security, University of Chinese Academy of Sciences, Beijing 100049, China
Key Laboratory of Cyberspace Security Defense, Beijing 100085, China)
- Ke Wang
(Department of Cryptography Science and Technology, Beijing Electronic Science and Technology Institute, Beijing 100070, China)
- Yanjun Li
(Information Industry Information Security Evaluation Center, The 15th Research Institute of China Electronics Technology Group Corporation, Beijing 100083, China)
- Li Yang
(Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100085, China
Key Laboratory of Cyberspace Security Defense, Beijing 100085, China)
Abstract
Due to the superiority of quantum computing, traditional cryptography is facing a severe threat. This makes the security evaluation of cryptographic systems in quantum attack models both significant and urgent. For symmetric ciphers, the security analysis heavily relies on cryptanalysis tools. Thus, exploring the use of quantum algorithms in traditional cryptanalysis tools has garnered considerable attention. In this study, we utilize quantum algorithms to improve impossible differential attacks and design two quantum automated tools to search for 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 for their implementation. Compared to the existing classical automated cryptanalysis, the proposed quantum tools 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 a single-key model.
Suggested Citation
Huiqin Xie & Qiqing Xia & Ke Wang & Yanjun Li & Li Yang, 2024.
"Quantum Automated Tools for Finding Impossible Differentials,"
Mathematics, MDPI, vol. 12(16), pages 1-26, August.
Handle:
RePEc:gam:jmathe:v:12:y:2024:i:16:p:2598-:d:1461970
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:16:p:2598-:d:1461970. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.