摘要
LBLOCK是吴文玲等人于2011年设计的一种轻量级密码算法。该文利用一个特殊的相关密钥差分特征,对19轮的LBlock算法进行了相关密钥不可能差分攻击,攻击的计算复杂度为70.0O(2),所需要的数据量为264。进一步,提出了一种针对21轮LBlock的相关密钥不可能差分攻击,计算复杂度为71.5O(2),数据量为263。
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 0(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 0(2715) 21-round encryptions for obtaining key.
出处
《电子与信息学报》
EI
CSCD
北大核心
2012年第9期2161-2166,共6页
Journal of Electronics & Information Technology
基金
通信保密重点实验室基金(9140C110202110C1101)
全军军事学研究生课题基金(2010JY0263-149)资助课题