Neural-Inspired Advances in Integral Cryptanalysis
Liu Zhang, Yiran Yao, Danping Shi, Dongchen Chai, Jian Guo, Zilong Wang
Abstract
The study by Gohr et al. at CRYPTO 2019 and sunsequent related works have shown that neural networks can uncover previously unused features, offering novel insights into cryptanalysis. Motivated by these findings, we employ neural networks to learn features specifically related to integral properties and integrate the corresponding insights into optimized search frameworks. These findings validate the framework of using neural networks for feature exploration, providing researchers with novel insights that advance established cryptanalysis methods. Neural networks have inspired the development of more precise integral search models. By comparing the integral distinguishers obtained via neural networks with those identified by classical methods, we observe that existing automated search models often fail to find optimal distinguishers. To address this issue, we develop a meet-in-the-middle search framework that balances model accuracy and computational efficiency. As a result, we reduce the number of active plaintext bits required for an 11-round integral distinguisher on SKINNY-64-64, and further identify a 12-round key-dependent integral distinguisher-achieving one additional round over the previous best-known result. The integral distinguishers discovered by neural networks enable keyrecovery attacks on more rounds. We identify a 7-round key-independent integral distinguisher from neural networks with even only one active plaintext cell, which is based on linear combinations of bits. This distinguisher enables a 15-round key-recovery attack on SKINNY-n-n through a strategy with 3 rounds of forward decryption and 5 rounds of backward encryption, improving upon the previous record by one round. The same distinguisher also enhances attacks on SKINNY-n-2n and SKINNY-n-3n. Additionally, we discover an 8-round key-dependent integral distinguisher using neural network that further reduces the time complexity of keyrecovery attacks against SKINNY.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 0d21131c-d653-494f-8a70-1640ade46f34Builds on1
Related papers
- Finding the Impossible: Automated Search for Full Impossible-Differential, Zero-Correlation, and Integral AttacksHosein Hadipour, Sadegh Sadeghi, Maria EichlsederEUROCRYPT 2023 · 39 citations
- Exploiting Non-full Key Additions: Full-Fledged Automatic Demirci-Selçuk Meet-in-the-Middle Cryptanalysis of SKINNYDanping Shi, Siwei Sun, Ling Song, Lei Hu et al.EUROCRYPT 2023 · 9 citations
- Differential Meet-In-The-Middle CryptanalysisChristina Boura, Nicolas David, Patrick Derbez, Gregor Leander et al.CRYPTO 2023 · 24 citations
- When the Wrong Key Lives On: The Key-Recovery Procedure in Integral AttacksChristof Beierle, Gregor Leander, Yevhen PerehudaEUROCRYPT 2026
- Meet-in-the-Middle Attacks Revisited: Key-Recovery, Collision, and Preimage AttacksXiaoyang Dong, Jialiang Hua, Siwei Sun, Zheng Li et al.CRYPTO 2021 · 54 citations
