Bibliographic Details
| Title: |
Improved Search of Boomerang Distinguishers for Generalized Feistel and Application to WARP |
| Authors: |
Xinhao Zeng, Lin Tan, Hong Xu |
| Source: |
IACR Transactions on Symmetric Cryptology, Vol 2025, Iss 1 (2025) |
| Publisher Information: |
Ruhr-Universität Bochum, 2025. |
| Publication Year: |
2025 |
| Collection: |
LCC:Computer engineering. Computer hardware |
| Subject Terms: |
Generalized Feistel, Boomerang, Rectangle attack, WARP, MILP, Computer engineering. Computer hardware, TK7885-7895 |
| More Details: |
Boomerang and rectangle cryptanalysis are powerful cryptanalytic techniques for security evaluation of block ciphers. Automated search for boomerang distinguishers is an important area of research. In FSE 2023, Hadipour et al. proposed a MILP model of searching boomerang distinguishers for Feistel structure, and applied their model to obtain the best known boomerang distinguishers to date for many generalized Feistel ciphers including WARP. In this paper, we focus on improving Hadipour et al.’s model for generalized Feistel structure and boomerang distinguishers on WARP. We show that a boomerang distinguisher with more active S-boxes may have a higher probability. It is caused by the semi-active S-boxes active only in one of the upper and lower differential trails, which are not considered in Hadipour et al.’s model. We classify the active S-boxes in the middle part Em in more detail, according to the associated tables of DDT, DDT2, FBCT and its variants in the computation formula of boomerang probability for Em. Then, we propose an improved MILP model to search boomerang distinguishers for generalized Feistel structure. Applying our model to WARP, we find better boomerang distinguishers for all rounds than those found by Hadipour et al.’s model. For 15-round boomerang distinguisher on WARP, the probability is improved by a factor of 25.78. For the longest 23-round boomerang distinguisher, the probability is improved by a factor of 24.23, resulting in the best result presented on WARP so far. Exploiting the properties of two local structures and the probabilistic extension technique, we improve the 26-round rectangle attack and give the first 27-round rectangle attack on WARP, which extends the best previous rectangle attack by one round. Note that our findings do not threaten the security of WARP which iterates 41 rounds. |
| Document Type: |
article |
| File Description: |
electronic resource |
| Language: |
English |
| ISSN: |
2519-173X |
| Relation: |
https://tosc.iacr.org/index.php/ToSC/article/view/12084; https://doaj.org/toc/2519-173X |
| DOI: |
10.46586/tosc.v2025.i1.444-470 |
| Access URL: |
https://doaj.org/article/208c79b8e14046c884b53fd0f16d003f |
| Accession Number: |
edsdoj.208c79b8e14046c884b53fd0f16d003f |
| Database: |
Directory of Open Access Journals |
