对简化版LBLock算法的相关密钥不可能差分攻击
doi: 10.3724/SP.J.1146.2012.00201
Related-key Impossible Differential Attack on Reduced Round LBlock
-
摘要: LBLOCK是吴文玲等人于2011年设计的一种轻量级密码算法。该文利用一个特殊的相关密钥差分特征，对19轮的LBlock算法进行了相关密钥不可能差分攻击，攻击的计算复杂度为O(270.0)，所需要的数据量为264。进一步，提出了一种针对21轮LBlock的相关密钥不可能差分攻击，计算复杂度为O(271.5)，数据量为263。Abstract: LBlock is a lightweight block cipher designed by Wu Wen-ling et al. in 2011. In this paper, a specific related-key differential is uesd to attack 19-round LBlock. The attack finds all the 80 bit keys in O(270.0) 19-round encryptions.The data complexity is 264 chosen plaintexts. Further more, a related-key impossible differential attack to 21-round Lblock is proposed. With 263 chosen plaintexts, the computing complexity of the attack is about O(271.5) 21-round encryptions for obtaining key.
-
计量
- 文章访问数: 2905
- HTML全文浏览量: 136
- PDF下载量: 744
- 被引次数: 0
下载:
