Piccolo算法的Biclique分析  

Biclique Cryptanalysis of Piccolo

作　　者：徐林宏 郭建胜[1] 崔竞一 李明明[1] XU Lin-Hong;GUO Jian-Sheng;CUI Jing-Yi;LI Ming-Ming(Information Engineering University,Zhengzhou 450001,China)

机构地区：[1]信息工程大学,郑州450001

出　　处：《密码学报》2019年第2期150-164,共15页Journal of Cryptologic Research

基　　金：信息保障技术重点实验室开放基金(KJ-17-003)~~

摘　　要：Piccolo算法作为一种硬件实现极为高效的轻量级分组密码算法,对其的安全性评估一直是学术界研究的热点.本文中基于Biclique攻击的思想,结合算法轮函数结构和密钥扩展方面的性质,利用非平衡Biclique攻击和Stars攻击两种方法对Piccolo-80和Piccolo-128算法分别进行了安全性分析.其中,对于Piccolo-80算法,进行非平衡Biclique攻击所需的数据复杂度、存储复杂度以及计算复杂度分别为2^(36)、2^(11.12)和2^(79.03);进行Stars攻击所需的数据复杂度、存储复杂度以及计算复杂度分别为2、2^(8.12)和2^(79.31).对于Piccolo-128算法的这两种攻击分别所需的数据复杂度为2^(20)、2,存储复杂度为2^(11.17)、2^(8.19),计算复杂度为2^(127.05)、2^(127.40).与现有的攻击结果相比,增加考虑了存储复杂度,且在数据复杂度和计算复杂度方面均有一定的优化.The lightweight block cipher Piccolo is very efficient for hardware implementation,and its security evaluation has been a hot topic in academia.Based on the idea of biclique attack,combined with the properties of the round function and the key schedule of Piccolo,this paper analyzes the security of Piccolo-80 and Piccolo-128 with unbalanced biclique attack and stars attack.For the unbalanced biclique attack of Piccolo-80,the required data complexity is 236,memory complexity is 211.12,and computational complexity is 279.03.For the Stars attack of Piccolo-80,the required data complexity is 2,memory complexity is 28.12 and computational complexity is 279.31.For the two attacks of Piccolo-128,the required data complexities are 220 and 2,memory complexities are 211.17 and 28.19,and computational complexities are 2127.05 and 2127.40,respectively.Compared with the existing attacks,this study takes into consideration of the memory complexity,and makes some optimization in terms of data complexity and computational complexity.

关 键 词：轻量级分组密码 Piccolo算法 密码分析 Biclique分析 Stars攻击 

分 类 号：TN918.4[电子电信—通信与信息系统]