Automated Meet-in-the-Middle Attack Goes to Feistel

被引:2
|
作者
Hou, Qingliang [1 ,2 ]
Dong, Xiaoyang [3 ,6 ,7 ]
Qin, Lingyue [4 ,6 ]
Zhang, Guoyan [1 ,5 ,7 ]
Wang, Xiaoyun [1 ,3 ,5 ,6 ,7 ]
机构
[1] Shandong Univ, Sch Cyber Sci & Technol, Qingdao, Peoples R China
[2] State Key Lab Cryptol, POB 5159, Beijing 100878, Peoples R China
[3] Tsinghua Univ, Inst Adv Study, BNRist, Beijing, Peoples R China
[4] Tsinghua Univ, BNRist, Beijing, Peoples R China
[5] Shandong Univ, Key Lab Cryptol Technol & Informat Secur, Minist Educ, Jinan, Peoples R China
[6] Zhongguancun Lab, Beijing, Peoples R China
[7] Shandong Inst Blockchain, Jinan, Peoples R China
基金
国家重点研发计划;
关键词
MitM; Automatic Tool; Feistel; Simpira v2; Lesamnta-LW; Areion; PREIMAGE ATTACKS; HASH FUNCTION; MD4; AES; CRYPTANALYSIS; SEARCH; V2;
D O I
10.1007/978-981-99-8727-6_13
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Feistel network and its generalizations (GFN) are another important building blocks for constructing hash functions, e.g., Simpira v2, Areion, and the ISO standard Lesamnta-LW. The Meet-in-the-Middle (MitM) is a general paradigm to build preimage and collision attacks on hash functions, which has been automated in several papers. However, those automatic tools mostly focus on the hash function with Substitution-Permutation network (SPN) as building blocks, and only one for Feistel network by Schrottenloher and Stevens (at CRYPTO 2022). In this paper, we introduce a new automatic model for MitM attacks on Feistel networks by generalizing the traditional direct or indirect partial matching strategies and also Sasaki's multi-round matching strategy. Besides, we find the equivalent transformations of Feistel and GFN can significantly simplify the MILP model. Based on our automatic model, we improve the preimage attacks on Feistel-SP-MMO, Simpira-2/-4-DM, Areion-256/-512-DM by 1-2 rounds or significantly reduce the complexities. Furthermore, we fill in the gap left by Schrottenloher and Stevens at CRYPTO 2022 on the large branch (b > 4) Simpira-b's attack and propose the first 11-round attack on Simpira-6. Besides, we significantly improve the collision attack on the ISO standard hash Lesamnta-LW by increasing the attacked round number from previous 11 to ours 17 rounds.
引用
收藏
页码:370 / 404
页数:35
相关论文
共 50 条
  • [1] Quantum meet-in-the-middle attack on Feistel construction
    Xu, Yinsong
    Yuan, Zheng
    QUANTUM INFORMATION PROCESSING, 2023, 22 (03)
  • [2] Quantum meet-in-the-middle attack on Feistel construction
    Yinsong Xu
    Zheng Yuan
    Quantum Information Processing, 22
  • [3] Meet-in-the-Middle Attacks on Generic Feistel Constructions
    Guo, Jian
    Jean, Jeremy
    Nikolic, Ivica
    Sasaki, Yu
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2014, PT I, 2014, 8873 : 458 - 477
  • [4] Extended meet-in-the-middle attacks on some Feistel constructions
    Guo, Jian
    Jean, Jeremy
    Nikolic, Ivica
    Sasaki, Yu
    DESIGNS CODES AND CRYPTOGRAPHY, 2016, 80 (03) : 587 - 618
  • [5] Extended meet-in-the-middle attacks on some Feistel constructions
    Jian Guo
    Jérémy Jean
    Ivica Nikolić
    Yu Sasaki
    Designs, Codes and Cryptography, 2016, 80 : 587 - 618
  • [6] Improved Meet-in-the-Middle Attacks on Generic Feistel Constructions
    Zhao, Shibin
    Duan, Xiaohan
    Deng, Yuanhao
    Peng, Zhiniang
    Zhu, Junhu
    IEEE ACCESS, 2019, 7 : 34416 - 34424
  • [7] Algebraic Meet-in-the-Middle Attack on LowMC
    Liu, Fukang
    Sarkar, Santanu
    Wang, Gaoli
    Meier, Willi
    Isobe, Takanori
    ADVANCES IN CRYPTOLOGY- ASIACRYPT 2022, PT I, 2022, 13791 : 225 - 255
  • [8] Meet-in-the-Middle Attacks on Classes of Contracting and Expanding Feistel Constructions
    Guo, Jian
    Jean, Jeremy
    Nikolic, Ivica
    Sasaki, Yu
    IACR TRANSACTIONS ON SYMMETRIC CRYPTOLOGY, 2016, 2016 (02) : 307 - 337
  • [9] The parallel-cut meet-in-the-middle attack
    Ivica Nikolić
    Lei Wang
    Shuang Wu
    Cryptography and Communications, 2015, 7 : 331 - 345
  • [10] MEET-IN-THE-MIDDLE ATTACK ON DIGITAL SIGNATURE SCHEMES
    OHTA, K
    KOYAMA, K
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 453 : 140 - 154