改进的Joltik-BC-128算法的中间相遇攻击  

Improved meet-in-the-middle attack on Joltik-BC-128

作　　者：李征 任炯炯 李曼曼[1] 陈少真[1] LI Zheng;REN Jiongjiong;LI Manman;CHEN Shaozhen(Information Engineering University,Zhengzhou 450001,China)

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

出　　处：《网络与信息安全学报》2024年第5期145-151,共7页Chinese Journal of Network and Information Security

基　　金：国家自然科学基金(62206312)。

摘　　要：Joltik-BC是在2014年亚密会上发布的一种轻量级可调分组密码算法,该算法采用替换-置换网络(SPN,substitution-permutation network)结构和Tweakey框架。通过研究Joltik-BC算法的内部特征,利用控制调柄差分方法,并结合差分枚举技术和S盒的差分特性,构造了6轮Joltik-BC-128算法的中间相遇区分器。利用此区分器改进了9轮Joltik-BC-128算法的中间相遇攻击结果。改进后的9轮Joltik-BC-128算法的中间相遇攻击的存储复杂度为244.91个长度为64的比特块,时间复杂度为248次9轮Joltik-BC-128加密。相比已有中间相遇攻击结果,该算法的时间复杂度和存储复杂度均显著降低。The Joltik-BC,adopting the substitution-permutation network structure and Tweakey framework,was a lightweight tweakable block cipher published at ASIACRPYPT 2014.By researching the internal characteristic of the Joltik-BC,a 6-round meet-in-the-middle distinguisher against the Joltik-BC-128 was constructed by controlling the tweakey differentials and combining differential enumeration and differential characteristics of S-boxes.An improved meet-in-the-middle attack against the 9-round Joltik-BC-128 was developed using this distinguisher.The memory and time complexities of the improved 9-round Joltik-BC-128 were 244.9164-bits blocks and 2489-round Joltik-BC-128 encryptions.Compared with existing meet-in-the-middle attack results,the time complexity and memory complexity of this method were significantly reduced.

关 键 词：分组密码 Joltik-BC 中间相遇攻击 差分枚举 

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