分组密码
排列(音乐)
数学
类型(生物学)
班级(哲学)
差速器(机械装置)
组合数学
离散数学
计算机科学
算法
密码学
生物
物理
工程类
航空航天工程
人工智能
声学
生态学
作者
Kosei Sakamoto,Kazuhiko Minematsu,Nao Shibata,Maki Shigeri,Hidenori Kubo,Takanori Isobe
标识
DOI:10.1587/transfun.2021cip0009
摘要
In spite of the research for a linear layer of Type-2 Generalized Feistel Network (Type-2 GFN) over more than 10 years, finding a good 32-branch permutation for Type-2 GFN is still a very hard task due to a huge search space. In terms of the diffusion property, Suzaki and Minematsu investigated the required number of rounds to achieve the full diffusion when the branch number is up to 16. After that, Derbez et al. presented a class of 32-branch permutations that achieves the 9-round full diffusion and they prove that this is optimal. However, this class is not suitable to be used in Type-2 GFN because it requires a large number of rounds to ensure a sufficient number of active S-boxes. In this paper, we present how to find a good class of 32-branch permutations for Type-2 GFN. To achieve this goal, we convert Type-2 GFN into a LBlock-like structure, and then we evaluate the diffusion property and the resistance against major attacks, such as differential, linear, impossible differential and integral attacks by an MILP. As a result, we present a good class of 32-branch permutations that achieves the 10-round full diffusion, ensures differentially/linearly active S-boxes of 66 at 19 round, and has the 18/20-round impossible differential/integral distinguisher, respectively. The 32-branch permutation used in WARP was chosen among this class.
科研通智能强力驱动
Strongly Powered by AbleSci AI