西安电子科技大学学报（自然科学版）Issue(5)：173-179,7.DOI:10.3969/j.issn.1001-2400.2014.05.029
对LBlock算法的多重零相关线性分析
Cryptanalysis of the LBlock using multiple zero-correlation linear approximations
摘要
Abstract
In order to reduce the data complexity of zero-correlation linear cryptanalysis of the LBlock, cryptanalysis of the LBlock using multiple zero-correlation linear approximations is presented.26 zero-correlations for 14 the round LBlock is proven,and its construction is given.The normal distribution probability model is applied to attack the 22 round LBlock,with the 26 zero-correlations for the 14 round LBlock used as the distinguisher.The data complexity of the cryptanalysis is about 263.45 known plaintexts, the computing complexity is about 276.27 ,and the success probability is 0.85.It is proved that the problem that the whole plaintext is needed to cryptanalyze the LBlock is solved.关键词
轻量级分组密码/LBlock算法/多重零相关线性逼近/密码分析/数据复杂度Key words
lightweight block cipher/LBlock cipher/multiple zero-correlation linear approximation/cryptanalysis/data complexity分类
信息技术与安全科学引用本文复制引用
罗芳,周学广,欧庆于..对LBlock算法的多重零相关线性分析[J].西安电子科技大学学报（自然科学版）,2014,(5):173-179,7.基金项目
国家自然科学基金资助项目(61100042,61202338) （61100042,61202338）
海军工程大学自然科学基金资助项目(HGDQNJJ13043) （HGDQNJJ13043）
