J4 ›› 2014, Vol. 41 ›› Issue (5): 173-179.doi: 10.3969/j.issn.1001-2400.2014.05.029

• 研究论文 • 上一篇    下一篇

对LBlock算法的多重零相关线性分析

罗芳;周学广;欧庆于   

  1. (海军工程大学 信息安全系,湖北 武汉  430033)
  • 收稿日期:2013-07-10 出版日期:2014-10-20 发布日期:2014-11-27
  • 通讯作者: 罗芳
  • 作者简介:罗芳(1983- ),女,讲师,E-mail: lf_0215@sina.com.
  • 基金资助:

    国家自然科学基金资助项目(61100042,61202338);海军工程大学自然科学基金资助项目(HGDQNJJ13043)

Cryptanalysis of the LBlock using multiple zero-correlation linear approximations

LUO Fang;ZHOU Xueguang;OU Qingyu   

  1. (Department of Information Security, Naval University of Engineering, Wuhan  430033, China)
  • Received:2013-07-10 Online:2014-10-20 Published:2014-11-27
  • Contact: LUO Fang

摘要:

为了降低对LBlock进行零相关线性分析所需的数据复杂度,提出了对LBlock进行多重零相关线性分析的方法,证明了14轮LBlock存在26条零相关线性逼近,并给出了其具体构造.利用26条14轮零相关线性逼近为区分器,并基于正态分布的概率计算模型对22轮LBlock进行了多重零相关线性攻击,攻击的数据复杂度约为263.45个已知明文,计算复杂度约为276.27次22轮LBlock加密,成功实施攻击的概率为0.85.结果表明,该方法有效解决了需要利用整个明文空间对LBlock进行零相关线性分析的问题.

关键词: 轻量级分组密码, LBlock算法, 多重零相关线性逼近, 密码分析, 数据复杂度

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.

Key words: lightweight block cipher, LBlock cipher, multiple zero-correlation linear approximation, cryptanalysis, data complexity

中图分类号: 

  • TN918.1
Baidu
map