通信学报2017，Vol.38Issue(5)：66-71,6.DOI:10.11959/j.issn.1000-436x.2017101
LBlock算法的相关密钥不可能飞来去器分析
Related-key impossible boomerang cryptanalysis on LBlock
摘要
Abstract
The related-key impossible boomerang cryptanalysis and the strength of the lightweight block cipher LBlock against this method were investigated.A new attack on 22-round LBlock was presented combining impossible boomerang attacks with related-key attacks.A 15-round related-key impossible boomerang distinguisher was constructed.Based on the new distinguisher,an attack on 22-round LBlock was mounted successfully by concatenating 3-round to the beginning and 4-round to the end.The attack on 22-round LBlock required data complexity of only 2513 plaintexts and computational complexity of about 271.54 22-round encryptions.Compared with published cryptanalysis results on 22-round LBlock,proposed attack has great advantages on data and computational complexities.关键词
LBlock算法/轻量级分组密码/相关密钥/不可能飞来去器Key words
LBlock algorithm/lightweight block cipher/related-key/impossible boomerang分类
信息技术与安全科学引用本文复制引用
谢敏,牟彦利..LBlock算法的相关密钥不可能飞来去器分析[J].通信学报,2017,38(5):66-71,6.基金项目
国家自然科学基金资助项目(No.61373170,No.U0835004,No.U1536202) （No.61373170,No.U0835004,No.U1536202）
国家111创新引智基金资助项目(No.B08038).The National Natural Science Foundation of China (No.61373170,No.U0835004,No.U1536202),The 111 Project of China (No.B08038) （No.B08038）
