GIFT-64算法的Biclique分析  

Biclique analysis of GIFT-64

作　　者：郭伟博[1] 刘彬[1] 王洋 Guo Weibo;Liu Bin;Wang Yang(Information Engineering University,Zhengzhou 450001,China;Xi’an Division of Surveying&Mapping,Xi’an 710054,China)

机构地区：[1]信息工程大学,郑州450001 [2]西安测绘总站,西安710054

出　　处：《计算机应用研究》2020年第5期1470-1473,共4页Application Research of Computers

摘　　要：GIFT算法是一种实现效率高、所需功耗低的轻量级分组密码算法,现有评估其安全性的研究成果较少。利用Biclique攻击方法,结合算法密钥调度方式以及轮函数结构的信息泄露规律,分别给出了对于GIFT-64算法的平衡Biclique攻击和Star攻击结果。对于GIFT-64算法的平衡Biclique攻击所需的数据复杂度和计算复杂度分别为232和2127.36;对于GIFT-64算法的Star攻击所需的数据复杂度和计算复杂度分别为2和2127.48。这是首个对于全轮GIFT-64算法的安全性分析结果。GIFT is a lightweight block cipher with high efficiency and low power consumption.There are few research results to evaluate its security.This paper presented the balanced Biclique and Star attacks on GIFT-64 based on the Biclique attack method,combined with the information leakage of the key scheduling and the round function structure of GIFT-64.The data complexity and computational complexity required for the balanced Biclique attack of GIFT-64 are 232 and 2127.36 respectively.The data complexity and computational complexity required for the Star attack of GIFT-64 are 2 and 2127.48 respectively.These are the first security analysis for the full-round GIFT-64.

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

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