Related-Key Impossible Diferential Attack on Reduced-Round LBlock

来源 :Journal of Computer Science & Technology | 被引量 : 0次 | 上传用户:ivyqbw
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
LBlock is a 32-round lightweight block cipher with 64-bit block size and 80-bit key. This paper identifies 16-round related-key impossible diferentials of LBlock, which are better than the 15-round related-key impossible diferentials used in the previous attack. Based on these 16-round related-key impossible diferentials, we can attack 23 rounds of LBlock while the previous related-key impossible diferential attacks could only work on 22-round LBlock. This makes our attack on LBlock the best attack in terms of the number of attacked rounds. This paper identifies 16-round related-key impossible diferentials of LBlock, which are better than the 15-round related-key impossible diferentials used in the previous attack. Based on these 16-round related-key impossible diferentials, we can attack 23 rounds of LBlock while the previous related-key impossible diferential attacks could only work on 22-round LBlock. This makes our attack on LBlock the best attack in terms of the number of attacked rounds.
其他文献