首页|SAILFISH-I、ASD算法基于MILP的积分分析

SAILFISH-I、ASD算法基于MILP的积分分析

扫码查看
SAILFISH-I、ASD算法是近些年提出的基于Feistel和SPN结构的轻量级分组密码.根据密码的结构特点,分别构造了基于比特的混合整数线性规划(MILP)可分性质模型,并使用求解器Gurobi对MILP模型求解.本文首次得到SAILFISH-I算法的8、9、10轮积分区分器,ASD算法的7、8、9轮积分区分器.在SAILFISH-I的9轮积分区分器的基础上,向后扩展3轮,进行12轮积分攻击,攻击的数据复杂度约为259.58个选择明文,时间复杂度约为2109.99次12轮加密,存储复杂度约为257个储存单元.在ASD的8轮积分区分器的基础上向后扩展2轮,进行10轮积分攻击,攻击的数据复杂度约为257.39个选择明文,时间复杂度约为270.07次10轮加密,存储复杂度约为220个储存单元.
Integral Analysis on SAILFISH-I and ASD Block Ciphers Based on MILP
SAILFISH-I and ASD are lightweight block cipher algorithms proposed in recent years based on the Feistel and SPN structures. According to the structure characteristics of the two algorithms,bit-based Mixed Integer Linear Programming (MILP) division property models are constructed and the Gu-robi is adopted to solve the MILP models. In this paper,8,9,and 10-round integral distinguishers for the SAILFISH-I algorithm and 7,8,and 9-round integral distinguishers for the ASD algorithm are ob-tained respectively for the first time. On the basis of the 9-round integral distinguisher,12-round inte-gral attack on the SAILFISH-I algorithm is performed with 3 rounds backward extension. Attack data complexity is~259. 58 times chosen plaintext size,and time complexity is~2109. 99 times 12-round en-cryption,and storage complexity is~257 memory cell. On the basis of the 8-round integral distinguis-her,10-round integral attack on the ASD algorithm is performed with 2 rounds backward extension. At-tack data complexity is~257. 39 times chosen plaintext size,and time complexity is~270. 07 times 10-round encryption,and storage complexity is~220 memory cell.

SAILFISH-IASDdivision propertyMILP (Mixed Integer Linear Programming)Integral Attack

吴铜、申龙

展开 >

北京电子科技学院,北京市 100070

SAILFISH-I ASD 可分性质 MILP 积分攻击

2024

北京电子科技学院学报
北京电子科技学院

北京电子科技学院学报

影响因子:0.245
ISSN:1672-464X
年,卷(期):2024.32(1)