Related-Key Differential Attack on Round Reduced RECTANGLE-80
Related-Key Differential Attack on Round Reduced RECTANGLE-80
复制标题
DOI：
--
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
Jinyong Shan;L. Hu;Ling Song;Siwei Sun;Xiaoshuang Ma
中科院分区：
文献类型：
--
作者：
Jinyong Shan;L. Hu;Ling Song;Siwei Sun;Xiaoshuang Ma
RECTANGLE是一种新提出的轻量级分组密码算法，它通过使用位片技术可以在多个平台上快速实现。它是一种迭代的25轮SPN分组密码，具有64位的块大小和80位或128位的密钥大小。到目前为止，对该密码的分析结果并不多，其中包括对设计者自己提出的18轮简化版本的攻击。在本文中，我们找到了所有15轮差分特征，对于给定的输入，输出和轮子密钥差异，有26-30个活动S盒，总概率为2−60.5。基于这些差分特征，我们将相应的递归算法分别向前和向后扩展到2轮，并提出了一种对19轮约简RECTANGLE-80的攻击方法，其数据复杂度为2个明文，时间复杂度约为2次迭代，存储复杂度为2.这些数据和时间复杂度远低于18轮简化矩形80的设计者。
RECTANGLE is a newly proposed lightweight block cipher which allows fast implementations for multiple platforms by using bitslice techniques. It is an iterative 25-round SPN block cipher with a 64-bit block size and a 80-bit or 128-bit key size. Until now, the results on analyzing the cipher are not too much, which includes an attack on the 18-round reduced version proposed by the designers themselves. In this paper, we find all 15-round differential characteristics with 26–30 active S-boxes for given input, output and round subkey differences, which have a total probability 2−60.5. Based on these differential characteristics, we extend the corresponding distinguisher to 2 rounds backward and forward respectively, and propose an attack on the 19-round reduced RECTANGLE-80 with data complexity of 2 plaintexts, time complexity of about 2 encryptions and memory complexity of 2. TThese data and time complexities are much lower than that of the designers for the 18-round reduced RECTANGLE-80.