Unveiling the Neutral Difference and Its Automated Search
Given a differential characteristic and an existing plaintext pair that satisfies it (referred to as a right pair), generating additional right pairs at a reduced cost is an appealing prospect. The neutral bit technique, referred to as neutral differences throughout this paper, provides a solution t...
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/2939486 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832546259030769664 |
|---|---|
| author | Guangqiu Lv Chenhui Jin Zhen Shi Ting Cui |
| author_facet | Guangqiu Lv Chenhui Jin Zhen Shi Ting Cui |
| author_sort | Guangqiu Lv |
| collection | DOAJ |
| description | Given a differential characteristic and an existing plaintext pair that satisfies it (referred to as a right pair), generating additional right pairs at a reduced cost is an appealing prospect. The neutral bit technique, referred to as neutral differences throughout this paper, provides a solution to this challenge. Traditionally, the search for neutral differences has heavily depended on experimental testing, leading to limitations in the search range. In this work, we propose the neutral difference table and establish a link between boomerang cryptanalysis and neutral differences. Furthermore, we propose an automated search for neutral differences to address the problem of a limited search range of neutral differences, as previous approaches relied on experimental testing. This approach provides a basis for the subspace spanned by the neutral differences, and we apply this technique to both SPECK32 and LEA, where the predicted results closely match the experimental ones. Consequently, we present the improved differential-linear distinguishers for SPECK32 and LEA, along with the 18-round attacks on LEA192 and LEA256 with the lowest time complexity up to date. |
| format | Article |
| id | doaj-art-43d12ee503164e4f957f58b15925d911 |
| institution | Kabale University |
| issn | 1751-8717 |
| language | English |
| publishDate | 2024-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | IET Information Security |
| spelling | doaj-art-43d12ee503164e4f957f58b15925d9112025-02-03T07:23:23ZengWileyIET Information Security1751-87172024-01-01202410.1049/2024/2939486Unveiling the Neutral Difference and Its Automated SearchGuangqiu Lv0Chenhui Jin1Zhen Shi2Ting Cui3PLA SSF Information Engineering UniversityPLA SSF Information Engineering UniversityPLA SSF Information Engineering UniversityPLA SSF Information Engineering UniversityGiven a differential characteristic and an existing plaintext pair that satisfies it (referred to as a right pair), generating additional right pairs at a reduced cost is an appealing prospect. The neutral bit technique, referred to as neutral differences throughout this paper, provides a solution to this challenge. Traditionally, the search for neutral differences has heavily depended on experimental testing, leading to limitations in the search range. In this work, we propose the neutral difference table and establish a link between boomerang cryptanalysis and neutral differences. Furthermore, we propose an automated search for neutral differences to address the problem of a limited search range of neutral differences, as previous approaches relied on experimental testing. This approach provides a basis for the subspace spanned by the neutral differences, and we apply this technique to both SPECK32 and LEA, where the predicted results closely match the experimental ones. Consequently, we present the improved differential-linear distinguishers for SPECK32 and LEA, along with the 18-round attacks on LEA192 and LEA256 with the lowest time complexity up to date.http://dx.doi.org/10.1049/2024/2939486 |
| spellingShingle | Guangqiu Lv Chenhui Jin Zhen Shi Ting Cui Unveiling the Neutral Difference and Its Automated Search IET Information Security |
| title | Unveiling the Neutral Difference and Its Automated Search |
| title_full | Unveiling the Neutral Difference and Its Automated Search |
| title_fullStr | Unveiling the Neutral Difference and Its Automated Search |
| title_full_unstemmed | Unveiling the Neutral Difference and Its Automated Search |
| title_short | Unveiling the Neutral Difference and Its Automated Search |
| title_sort | unveiling the neutral difference and its automated search |
| url | http://dx.doi.org/10.1049/2024/2939486 |
| work_keys_str_mv | AT guangqiulv unveilingtheneutraldifferenceanditsautomatedsearch AT chenhuijin unveilingtheneutraldifferenceanditsautomatedsearch AT zhenshi unveilingtheneutraldifferenceanditsautomatedsearch AT tingcui unveilingtheneutraldifferenceanditsautomatedsearch |