Yoyo trick on type‐II generalised Feistel networks
Abstract This work presents a structural attack against the type‐II generalised Feistel network (GFN) with secret internal functions. First, equivalent structures of the 7‐round type‐II GFN are provided, which helps reduce the first guess of the secret round functions. Then, two yoyo game distinguis...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-11-01
|
| Series: | IET Information Security |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/ise2.12035 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832546840097062912 |
|---|---|
| author | Tao Hou Ting Cui |
| author_facet | Tao Hou Ting Cui |
| author_sort | Tao Hou |
| collection | DOAJ |
| description | Abstract This work presents a structural attack against the type‐II generalised Feistel network (GFN) with secret internal functions. First, equivalent structures of the 7‐round type‐II GFN are provided, which helps reduce the first guess of the secret round functions. Then, two yoyo game distinguishers are simultaneously employed for these structures to reduce the data complexity by half. Based on these two distinguishers, it is found that the original yoyo game algorithm, proposed to attack the 5‐round Feistel structure, is not suitable for these structures, owing to the characteristics of the yoyo game cycle. To solve this problem, the partial look‐up table recycling technique is presented, which can utilise collision cycles with insufficient information. This technique performs better as the width of each branch ‘n’ grows. For yoyo game attacks, this study systematically investigates its cycle characteristics to determine the reason for the short collision cycle. For 7‐round type‐II GFNs, this work presents the first decomposition thus far, which can be executed within a time complexity of O(n24n + 3) and a data complexity of O(23n + 2). We believe this work enriches the yoyo game attack and the application of type‐II GFNs. |
| format | Article |
| id | doaj-art-da836da88d704272bb36dfd5cb1cac4c |
| institution | Kabale University |
| issn | 1751-8709 1751-8717 |
| language | English |
| publishDate | 2021-11-01 |
| publisher | Wiley |
| record_format | Article |
| series | IET Information Security |
| spelling | doaj-art-da836da88d704272bb36dfd5cb1cac4c2025-02-03T06:47:11ZengWileyIET Information Security1751-87091751-87172021-11-0115645747110.1049/ise2.12035Yoyo trick on type‐II generalised Feistel networksTao Hou0Ting Cui1PLA SSF Information Engineering University Zhengzhou ChinaPLA SSF Information Engineering University Zhengzhou ChinaAbstract This work presents a structural attack against the type‐II generalised Feistel network (GFN) with secret internal functions. First, equivalent structures of the 7‐round type‐II GFN are provided, which helps reduce the first guess of the secret round functions. Then, two yoyo game distinguishers are simultaneously employed for these structures to reduce the data complexity by half. Based on these two distinguishers, it is found that the original yoyo game algorithm, proposed to attack the 5‐round Feistel structure, is not suitable for these structures, owing to the characteristics of the yoyo game cycle. To solve this problem, the partial look‐up table recycling technique is presented, which can utilise collision cycles with insufficient information. This technique performs better as the width of each branch ‘n’ grows. For yoyo game attacks, this study systematically investigates its cycle characteristics to determine the reason for the short collision cycle. For 7‐round type‐II GFNs, this work presents the first decomposition thus far, which can be executed within a time complexity of O(n24n + 3) and a data complexity of O(23n + 2). We believe this work enriches the yoyo game attack and the application of type‐II GFNs.https://doi.org/10.1049/ise2.12035cryptographycomputational complexity |
| spellingShingle | Tao Hou Ting Cui Yoyo trick on type‐II generalised Feistel networks IET Information Security cryptography computational complexity |
| title | Yoyo trick on type‐II generalised Feistel networks |
| title_full | Yoyo trick on type‐II generalised Feistel networks |
| title_fullStr | Yoyo trick on type‐II generalised Feistel networks |
| title_full_unstemmed | Yoyo trick on type‐II generalised Feistel networks |
| title_short | Yoyo trick on type‐II generalised Feistel networks |
| title_sort | yoyo trick on type ii generalised feistel networks |
| topic | cryptography computational complexity |
| url | https://doi.org/10.1049/ise2.12035 |
| work_keys_str_mv | AT taohou yoyotrickontypeiigeneralisedfeistelnetworks AT tingcui yoyotrickontypeiigeneralisedfeistelnetworks |