Automatic Search of Differential Characteristics and Improved Differential Cryptanalysis for PRINCE, QARMA, and MANTIS
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 reflec...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-01-01
|
| Series: | IET Information Security |
| Online Access: | http://dx.doi.org/10.1049/2024/5574862 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832542980346478592 |
|---|---|
| author | Yaxin Cui Hong Xu Lin Tan Wenfeng Qi |
| author_facet | Yaxin Cui Hong Xu Lin Tan Wenfeng Qi |
| author_sort | Yaxin Cui |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-d34c42eb5478433b83e00b2b3e49b98b |
| institution | Kabale University |
| issn | 1751-8717 |
| language | English |
| publishDate | 2024-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | IET Information Security |
| spelling | doaj-art-d34c42eb5478433b83e00b2b3e49b98b2025-02-03T12:01:07ZengWileyIET Information Security1751-87172024-01-01202410.1049/2024/5574862Automatic Search of Differential Characteristics and Improved Differential Cryptanalysis for PRINCE, QARMA, and MANTISYaxin Cui0Hong Xu1Lin Tan2Wenfeng Qi3Information Engineering UniversityInformation Engineering UniversityInformation Engineering UniversityInformation Engineering UniversityReflection 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.http://dx.doi.org/10.1049/2024/5574862 |
| spellingShingle | Yaxin Cui Hong Xu Lin Tan Wenfeng Qi Automatic Search of Differential Characteristics and Improved Differential Cryptanalysis for PRINCE, QARMA, and MANTIS IET Information Security |
| title | Automatic Search of Differential Characteristics and Improved Differential Cryptanalysis for PRINCE, QARMA, and MANTIS |
| title_full | Automatic Search of Differential Characteristics and Improved Differential Cryptanalysis for PRINCE, QARMA, and MANTIS |
| title_fullStr | Automatic Search of Differential Characteristics and Improved Differential Cryptanalysis for PRINCE, QARMA, and MANTIS |
| title_full_unstemmed | Automatic Search of Differential Characteristics and Improved Differential Cryptanalysis for PRINCE, QARMA, and MANTIS |
| title_short | Automatic Search of Differential Characteristics and Improved Differential Cryptanalysis for PRINCE, QARMA, and MANTIS |
| title_sort | automatic search of differential characteristics and improved differential cryptanalysis for prince qarma and mantis |
| url | http://dx.doi.org/10.1049/2024/5574862 |
| work_keys_str_mv | AT yaxincui automaticsearchofdifferentialcharacteristicsandimproveddifferentialcryptanalysisforprinceqarmaandmantis AT hongxu automaticsearchofdifferentialcharacteristicsandimproveddifferentialcryptanalysisforprinceqarmaandmantis AT lintan automaticsearchofdifferentialcharacteristicsandimproveddifferentialcryptanalysisforprinceqarmaandmantis AT wenfengqi automaticsearchofdifferentialcharacteristicsandimproveddifferentialcryptanalysisforprinceqarmaandmantis |