首页|RAIN-128算法的中间相遇攻击

RAIN-128算法的中间相遇攻击

扫码查看
RAIN是一族SPN结构的轻量级分组密码算法,该算法具有软硬件实现效率高、安全性强等特点.中间相遇攻击被广泛应用于分组密码算法的安全性分析中.该文通过分析RAIN-128的结构特性和截断差分特征,利用差分枚举技术分别构造了4轮和6轮中间相遇区分器,给出了8轮及10轮的中间相遇攻击.当攻击轮数为8轮时,预计算阶段的时间复杂度为268次8轮RAIN-128加密,存储复杂度为275 bit,在线攻击阶段的时间复杂度为2109次8轮加密,数据复杂度是272个选择明文;当攻击轮数为10轮时,预计算阶段的时间复杂度为2214次10轮加密,存储复杂度为2219bit,在线攻击阶段的时间复杂度为2109次10轮加密,数据复杂度是272个选择明文,分析结果显示,RAIN-128可以抵抗中间相遇攻击,并具有较高的安全冗余.
Meet-in-the-middle Attack on RAIN-128
RAIN is a lightweight block cipher with SPN structure,which not only has strong security,but also possesses high software and hardware implementation efficiency.Meet-in-the-middle attacks are widely used in the security analysis of block ciphers algorithms.In this paper,the meet-in-the-middle attack on RAIN is researched.By examining the structural characteristics and the properties of truncated differential of RAIN-128,both 4-round and 6-round meet-in-the-middle distinguishers are first constructed by using differential enumeration technique,and meet-in-the-middle attacks on 8-round and 10-round RAIN-128 are presented,respectively.For 8-round attack,in the preprocessing,the time complexity is2688-round encryptions,and the memory complexity is275bit,in the online,the time complexity is21098-round encryptions,and the data complexity is272chosen plaintexts.For 10-round attack,in the preprocessing,the time complexity is221410-round encryptions,and the memory complexity is2219bit,in the online,the time complexity is210910-round encryptions,and the data complexity is272chosen plaintexts.The result shows that RAIN-128 can be against meet-in-the-middle attack and has high security redundancy.

Block ciphersRAIN-128Meet-in-the-middle attackDifferential enumeration technique

杜小妮、郑亚楠、梁丽芳、李锴彬

展开 >

西北师范大学数学与统计学院 兰州 730070

西北师范大学密码技术与数据分析重点实验室 兰州 730070

西北师范大学计算机科学与工程学院 兰州 730070

分组密码 RAIN-128 中间相遇攻击 差分枚举技术

国家自然科学基金

62172337

2024

电子与信息学报
中国科学院电子学研究所 国家自然科学基金委员会信息科学部

电子与信息学报

CSTPCD北大核心
影响因子:1.302
ISSN:1009-5896
年,卷(期):2024.46(1)
  • 4