摘要
分别针对近年来提出的SPN结构的BORON密码算法和Feistel结构的Khudra密码算法进行积分性质的评估。根据各自算法线性层和非线性层的结构,建立基于比特可分性的混合整数线性规划(MILP)模型。根据最终搜索的目标轮数生成相应的目标函数,利用Gurobi优化器进行求解,并进行积分区分器的搜索,分别得到了BORON算法的6轮积分区分器和Khudra算法的7轮积分区分器,均是目前已知的最长区分器。利用积分区分器,可以对密码算法进行更多轮数的积分性质评估。
This paper evaluated the integral properties of BORON cryptography algorithm with SPN structure and Khudra cryptography algorithm with Feistel structure.It established MILP model based on bit-based division according to the structure of linear layer and nonlinear layer.It generated the corresponding objective function according to the number of target rounds in the final search,and utilized the optimizer of Gurobi to solve the model and searched the distinguisher.Finally,it obtained the 6-round integral distinguisher of BORON and the 7-round integral distinguisher of Khudra,which were the longest distingui-shers at present.By using these distinguishers,more rounds of assessment of integral properties can be carried out.
作者
李艳俊
梁萌
Li Yanjun;Liang Meng(Beijing Electronic Science&Technology Institute,Beijing 100070,China)
出处
《计算机应用研究》
CSCD
北大核心
2020年第10期3063-3067,共5页
Application Research of Computers
基金
中央高校基本科研业务费资助项目(328201915)。
