Automatic Search of Differential Characteristics and Improved Differential Cryptanalysis for PRINCE, QARMA, and MANTIS
Open Access
- 1 January 2024
- journal article
- research article
- Published by Institution of Engineering and Technology (IET) in IET Information Security
- Vol. 2024 (1)
Abstract
Reflection structure has a significant advantage that realizing decryption and encryption results in minimum additional costs, and many block ciphers tend to adopt such structure to achieve the requirement of low overhead. PRINCE, MANTIS, QARMA, and PRINCEv2 are lightweight block ciphers with reflection feature proposed in recent years. In this paper, we consider the automatic differential cryptanalysis of reflection block ciphers based on Boolean satisfiability (SAT) method. Since reflection block ciphers have different round functions, we extend forward and backward from the middle structure and achieve to accelerate the search of the optimal differential characteristics for such block ciphers with the Matsui’s bounding conditions. As a result, we present the optimal differential characteristics for PRINCE up to 12 rounds (full round), and they are also the optimal characteristics for PRINCEv2. We also find the optimal differential characteristics for MANTIS, QARMA‐64, and QARMA‐128 up to 10, 12, and 8 rounds, respectively. To mount an efficient differential attack on such block ciphers, we present a uniform SAT model by combining the differential characteristic searching process and the key recovery process. With this model, we find two sets of 7‐round differential characteristics for PRINCE with less guessed key bits and use them to present a multiple differential attack against 11‐round PRINCE, which improves the known single‐key attack on PRINCE by one round to our knowledge.Keywords
Funding Information
- National Natural Science Foundation of China (62202494)
This publication has 19 references indexed in Scilit:
- STP models of optimal differential and linear trail for S-box based ciphersScience China Information Sciences, 2021
- Meet-in-the-Middle Attacks and Structural Analysis of Round-Reduced PRINCEJournal of Cryptology, 2020
- Automatic search method for multiple differentials and its application on MANTISScience China Information Sciences, 2019
- Meet-in-the-Middle Attacks on Reduced-Round QARMA-64/128The Computer Journal, 2018
- Practical attacks on the round‐reduced PRINCEIET Information Security, 2017
- The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS2016
- Observations on the SIMON Block Cipher Family2015
- Automatic Security Evaluation and (Related-key) Differential Characteristic Search: Application to SIMON, PRESENT, LBlock, DES(L) and Other Bit-Oriented Block Ciphers2014
- PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications2012
- Multiple Differential Cryptanalysis: Theory and Practice2011