| 对LBlock算法的多重零相关线性分析 |
| |
| 引用本文： | 罗芳,周学广,欧庆于.对LBlock算法的多重零相关线性分析[J].西安电子科技大学学报,2014,41(5):173-179. |
| |
| 作者姓名： | 罗芳 周学广 欧庆于 |
| |
| 作者单位： | (海军工程大学 信息安全系，湖北 武汉430033) |
| |
| 基金项目： | 国家自然科学基金资助项目(61100042,61202338)；海军工程大学自然科学基金资助项目(HGDQNJJ13043) |
| |
| 摘 要： | 为了降低对LBlock进行零相关线性分析所需的数据复杂度，提出了对LBlock进行多重零相关线性分析的方法，证明了14轮LBlock存在26条零相关线性逼近，并给出了其具体构造．利用26条14轮零相关线性逼近为区分器，并基于正态分布的概率计算模型对22轮LBlock进行了多重零相关线性攻击，攻击的数据复杂度约为263.45个已知明文，计算复杂度约为276.27次22轮LBlock加密，成功实施攻击的概率为0.85．结果表明，该方法有效解决了需要利用整个明文空间对LBlock进行零相关线性分析的问题．
|
| 关 键 词： | 轻量级分组密码 LBlock算法 多重零相关线性逼近 密码分析 数据复杂度 |
| 收稿时间： | 2013-07-10 |
Cryptanalysis of the LBlock using multiple zero-correlation linear approximations |
| |
| LUO Fang,ZHOU Xueguang,OU Qingyu.Cryptanalysis of the LBlock using multiple zero-correlation linear approximations[J].Journal of Xidian University,2014,41(5):173-179. |
| |
| Authors: | LUO Fang ZHOU Xueguang OU Qingyu |
| |
| Affiliation: | (Department of Information Security, Naval University of Engineering, Wuhan 430033, China) |
| |
| 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. |
| |
| Keywords: | lightweight block cipher LBlock cipher multiple zero-correlation linear approximation cryptanalysis data complexity |
|
| 点击此处可从《西安电子科技大学学报》浏览原始摘要信息 |
|
点击此处可从《西安电子科技大学学报》下载全文 |
