节点文献

Robin算法一个新的不可能差分攻击

A Novel Impossible Differential Attack on Robin Algorithm

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 王佳琳欧海文施瑞

【Author】 WANG Jialin;OU Haiwen;SHI Rui;Xidian University;Beijing Electronic Science and Technology Institute;

【机构】 西安电子科技大学北京电子科技学院

【摘要】 Robin算法是采用比特切片设计的一个分组密码算法,本文研究给出该算法之不可能差分攻击区分器的一定改良。具体地,在前人的研究基础上,改变一个约束条件而推导出关于Robin算法的一个重要性质。根据该性质,利用轮密钥之间的线性关系可构造出新的区分器形式,从而降低选择明文数N。基于该区分器攻击的时间复杂度为大约2118.21次6轮加密运算、数据复杂度为2111.18(较已有结果降低了大约28)。

【Abstract】 Robin algorithm is a block cipher algorithm designed with bit slices. In this paper, a partly improved distinguisher against the impossible differential attack on Robin algorithm is studied and presented. Concretely, an important character of Robin algorithm is derived by changing a constraint condition on the basis of previous researches. According to the derived character, the linear relationship between the round keys is used to construct a novel distinguisher form to reduce the number of selected plaintexts. Time complexity of the attack based on the distinguisher is 2118.21 times 6-round encryptions and data complexity is 2111.18 that is about 28 reduced compared with the available results.

【基金】 国家重点研发计划基金资助项目(No.2017YFB0801803)
  • 【文献出处】 北京电子科技学院学报 ,Journal of Beijing Electronic Science and Technology Institute , 编辑部邮箱 ,2021年02期
  • 【分类号】TN918.1
  • 【下载频次】85
节点文献中: 

本文链接的文献网络图示:

本文的引文网络