EUVIMEDEUVIMED entdecken
Crossref

A Unified Key Recovery Framework for Impossible Boomerang Attacks: Applications to Full-Round-ARADI and SKINNYe v2

Lin Jiao, Xichao Hu, Dengguo Feng, Yongqiang Li, Senpeng Wang, Yonglin Hao, Xinxin Gong

IEEE Transactions on Information Theory · 2026-07 · 72 (7) · 5183-5206

DOI: 10.1109/tit.2026.3693296 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2026-07. Verfasst von Lin Jiao und 6 weiteren Autor:innen. Gefördert von: National Key Research and Development Program of China, National Natural Science Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The impossible boomerang attack is a powerful cryptanalytic technique, but existing key recovery methods face several limitations that restrict its applicability. Specifically, the key pre-guessing is coarse-grained, S-box details are ignored in the differential propagation, the complexity estimation and the key guessing order determination remain rudimentary. To overcome these issues, we introduce three key improvement measures. First, we propose a flexible partial key and difference pre-guessing technique based on directed graphs, enabling selective identification of required keys and differences for generating partial pairs and quartets. Second, we propose a pre-sieving technique to early eliminate invalid quartets by exploiting cipher-specific details. Third, we introduce an automatic key-guessing strategy based on the same directed graphs to efficiently determine valid guessing orders. We integrate these techniques to develop a unified key recovery framework for impossible boomerang attacks, accompanied by a formal and precise characterization of the overall complexity. This is the first framework to support flexible key and difference pre-guessing while incorporating block cipher details during key recovery for impossible boomerang attacks. Crucially, it enables the automatic generation of detailed recovery steps, a capability missing in prior work. As applications, under the four related-key/tweakey setting, we apply the framework to ARADI , a low-latency cipher proposed by the National Security Agency (NSA), and SKINNYev2 , a threshold-implementation-friendly cipher proposed at EUROCRYPT 2020. For ARADI , we achieve the first full-round attack with $2^{130}$ data, $2^{253.78}$ time, and $2^{235.75}$ memory complexity. For SKINNYev2 , we present the first 34-round impossible boomerang attack with $2^{66}$ data, $2^{253.75}$ time, and $2^{239.75}$ memory complexity. These results demonstrate the framework’s significance and its substantial improvement in advancing the impossible boomerang attack.

Förderung

  • National Key Research and Development Program of China
  • National Natural Science Foundation

Zitieren

APA

Jiao, L., Hu, X., Feng, D., Li, Y., Wang, S., Hao, Y., & Gong, X. (2026). A Unified Key Recovery Framework for Impossible Boomerang Attacks: Applications to Full-Round-ARADI and SKINNYe v2. IEEE Transactions on Information Theory, 72(7), 5183-5206. https://doi.org/10.1109/tit.2026.3693296

Vancouver

Jiao L, Hu X, Feng D, Li Y, Wang S, Hao Y, et al. A Unified Key Recovery Framework for Impossible Boomerang Attacks: Applications to Full-Round-ARADI and SKINNYe v2. IEEE Transactions on Information Theory. 2026;72(7):5183-5206. doi:10.1109/tit.2026.3693296

BibTeX
@article{Jiao2026,
  author = {Jiao, Lin and Hu, Xichao and Feng, Dengguo and Li, Yongqiang and Wang, Senpeng and Hao, Yonglin and Gong, Xinxin},
  title = {A Unified Key Recovery Framework for Impossible Boomerang Attacks: Applications to Full-Round-ARADI and SKINNYe v2},
  journal = {IEEE Transactions on Information Theory},
  year = {2026},
  volume = {72},
  number = {7},
  pages = {5183--5206},
  doi = {10.1109/tit.2026.3693296}
}
Kostenlos starten →