电子学报Issue(10)：1948-1953,6.DOI:10.3969/j.issn.0372-2112.2015.10.011
LBlock 算法的相关密钥－不可能差分攻击
Related-Key I mpossible Differential Attacks on LBlock
摘要
Abstract
In this paper,the strength of LBlock against related-key impossible differential attack is examined.Based on the differential information leakages in sub-key schedule,several sub-key differentials in low weight are constructed,and a 15-round re-lated-key impossible differential distinguisher of LBlock is presented.By extending the distinguisher,related-key impossible differen-tial attacks on 23-round LBlock and 24-round LBlock are presented.The data complexities of the attacks are 265.2 and 265.6 chosen-plain-text,respectively;the computing complexities of the attacks are 266.2 23-round LBlock encryptions and 266.6 24-round LBlock encryptions,respectively;the storage complexities of the attacks are 261 .2 and 277.2 bytes of memory space,respectively.The crypt-analysis of reduced-round LBlock are first extended to 23-round and 24-round in this paper.关键词
分组密码/密码分析/LBlock 算法/相关密钥-不可能差分攻击Key words
block cipher/cryptanalysis/LBlock/related-key impossible differential attack分类
信息技术与安全科学引用本文复制引用
黄永洪,郭建胜,罗伟..LBlock 算法的相关密钥－不可能差分攻击[J].电子学报,2015,(10):1948-1953,6.基金项目
国家自然科学基金（No．61272488）；博士后科学基金 （）
