SPECK分组密码算法的立方测试与分析

发布时间：2018-06-15 00:22

本文选题：SPECK/密码算法 + 密钥中比特　；参考：《计算机工程》2016年11期

【摘要】：SPECK类算法是一类轻量级分组密码算法,由于其出色的平台适用性和软件实现性能而备受关注。针对当前SPECK类算法在抵御立方攻击以及算法内部结构对密钥比特的混淆和扩散方面存在安全隐患的问题,分别利用立方攻击结合二次测试和立方测试对SPECK32/64算法进行分析,在选择明文攻击条件下,若算法简化到3轮,可直接恢复17 bit密钥,攻击时间复杂度约为247,若算法简化到5轮~7轮,通过立方测试均能捕获到密钥中比特。结果表明,SPECK32/64算法需经过8轮以上的迭代操作才能有效抵抗立方分析。
[Abstract]:Speck-class algorithms are a class of lightweight block cipher algorithms, which have attracted much attention because of their excellent platform applicability and software implementation performance. In view of the hidden security problems of the current SPECK algorithms in resisting cubic attacks and the confusion and diffusion of key bits by the internal structure of the algorithm, the SPECK32 / 64 algorithm is analyzed by using cubic attack combined with quadratic test and cubic test, respectively. Under the condition of selecting plaintext attack, if the algorithm is simplified to 3 rounds, the 17 bit key can be recovered directly, and the attack time complexity is about 247. If the algorithm is simplified to 5 rounds or 7 rounds, the bits in the key can be captured through the cube test. The results show that SPECK32 / 64 algorithm needs more than 8 iterations to resist cube analysis effectively.
【作者单位】：桂林电子科技大学认知无线电与信息处理省部共建教育部重点实验室;中国科学院信息工程研究所信息安全国家重点实验室;
【基金】：国家自然科学基金(61572148) 广西自然科学基金(2015GXNSFGA139007) 广西高等学校优秀中青年骨干教师培养工程(第二期)项目桂林电子科技大学研究生创新基金(ZYJ17061)
【分类号】：TN918.4

【相似文献】