SIMON算法的不可能差分分析

发布时间：2018-06-13 06:24

本文选题：SIMON算法 + 不可能差分攻击　；参考：《密码学报》2015年06期

【摘要】：SIMON算法是2013年由NSA提出的一族轻量级分组密码算法,至今已有很多密码学者进行了安全性分析,如线性分析,差分分析,不可能差分和零相关线性hull分析等.SIMON算法根据不同的分组和密钥长度一共提供了10个不同的版本,可以满足不同的安全性需求.在这篇论文中,我们首先利用自动化搜索技术,获得了SIMON32算法最长的不可能差分路径,在此基础上对SIMON算法进行了不可能差分分析.我们给出了19轮SIMON 32/64的不可能差分分析的详细过程.在数据收集过程中,我们利用明文差分和第一轮输出差分与密钥无关的特点,使用建立并解方程的方法构造出满足明文和第一轮输出差分条件的明密文对,极大地降低了数据收集过程的计算复杂度.在密钥恢复过程中,采用Wang等提出的动态密钥猜测技术,降低了密钥过滤过程中的计算复杂度,改进了之前SIMON算法的不可能差分结果.
[Abstract]:Simon algorithm is a class of lightweight block cipher algorithms proposed by the NSA in 2013. So far, many cryptographers have done security analysis, such as linear analysis, differential analysis. It is impossible to provide 10 different versions of SIMON algorithm based on different packet and key length, such as differential and zero correlation linear hull analysis, which can meet different security requirements. In this paper, we first obtain the longest impossibility difference path of SIMON32 algorithm by using automatic search technology, and then we analyze the impossibility difference of Simon algorithm. We give a detailed process of 19 rounds of Simon 32 / 64 impossibility difference analysis. In the process of data collection, we make use of the characteristics of plaintext difference and first-round output difference independent of the key, and use the method of establishing and solving equations to construct the ciphertext pair which satisfies the difference condition of plaintext and first-round output. The computational complexity of the data collection process is greatly reduced. In the process of key recovery, the dynamic key guessing technique proposed by Wang et al is used to reduce the computational complexity in the process of key filtering, and the impossibility difference result of Simon algorithm is improved.
【作者单位】：清华大学计算机系密码理论与技术研究中心;山东大学密码技术与信息安全教育部重点实验室;
【基金】：国家自然科学基金重点项目(61133013)
【分类号】：TN918.4

【相似文献】