arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.01052cs.CR
收藏

增强基于MILP/MIQCP的Simon类密码差分-线性区分器自动搜索

Enhancing the MILP/MIQCP-based Automatic Search for Differential-Linear Distinguishers of Simon-Like Ciphers

Siwei Chen, Zejun Xiang, Xiangyong Zeng, Guangxue Qin

AI总结:

本文提出基于MILP/MIQCP的改进方法,结合精确线性建模、分治启发式策略和变换技术,为Simon和Simeck密码家族自动搜索差分-线性区分器,将Simon32/48/64/96的最长区分器分别延长一至两轮,并通过实验验证了方法的有效性。

摘要:

本文提出了一种基于混合整数线性规划/混合整数二次约束规划(MILP/MIQCP)的改进方法,用于为Simon和Simeck分组密码家族的所有成员自动寻找更好的差分-线性(DL)区分器。具体而言,我们首先给出了完全精确的MILP模型来描述线性部分,并解释了如何利用Gurobi求解器的通用表达式以一种相当简单的方式对中间部分的连续差分传播进行建模。其次,为了在合理时间内求解MILP/MIQCP模型,我们提出了两种基于分治思想的启发式策略来加速搜索过程。第三,我们引入了变换技术,该技术利用DL轨迹上的聚类效应来改进DL近似的估计相关性。我们将该方法应用于Simon和Simeck分组密码家族。结果,我们找到了Simon32/48/64/96的14/17/21/26轮理论DL区分器,分别将此前Simon32/48/96的最长区分器延长了一轮,并将Simon64的最长区分器延长了两轮。对于Simeck,与当前最佳结果相比,我们没有探索出更长的区分器,但刷新了Zhou等人(首个使用MILP/MIQCP自动寻找Simon类密码DL区分器的工作)的所有结果。此外,为了验证这些区分器的正确性,我们在Simon32/Simeck32和Simon48/Simeck48上进行了实验验证。结果表明,我们对相关性的理论估计与实验结果非常接近,这可视为对我们方法有效性的具体支持。

英文摘要:

In this paper, we propose an improved method based on Mixed-Integer Linear Programming/Mixed-Integer Quadratic Constraint Programming (MILP/MIQCP) to automatically find better differential-linear (DL) distinguishers for the all members of Simon and Simeck block cipher families. To be specific, we first give the completely precise MILP model to describe the linear part, and explain how to utilize the general expressions of \textsf{Gurobi} solver to model the propagation of continuous difference for the middle part in a quite easy way. Secondly, in order to solve the MILP/MIQCP model in a reasonable time, we propose two heuristic strategies based on the divide-and-conquer idea to speed up the search process. Thirdly, we introduce the transforming technique, which exploits the clustering effect on DL trails, to improve the estimated correlation of the DL approximation. We apply our method to Simon and Simeck block cipher families. Consequently, we find the 14/17/21/26-round theoretical DL distinguishers of Simon32/48/64/96, which extend the previous longest ones of Simon32/48/96 by one round and Simon64 by two rounds, respectively. For Simeck, we do not explore longer distinguishers compared to the currently best results, but refresh all the results of Zhou et al. (the first work to automate finding DL distinguishers for Simon-like ciphers using MILP/MIQCP). Besides, in order to validate the correctness of these distinguishers, the experimental verifications are conducted on Simon32/Simeck32 and Simon48/Simeck48. The results show that our theoretical estimations on correlations are very close to the experimental ones, which can be regarded as a concrete support for the effectiveness of our method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑