电子学报 ›› 2015, Vol. 43 ›› Issue (10): 1948-1953.DOI: 10.3969/j.issn.0372-2112.2015.10.011

• 学术论文 • 上一篇    下一篇

LBlock算法的相关密钥-不可能差分攻击

黄永洪1, 郭建胜2,4, 罗伟3   

  1. 1. 重庆邮电大学, 重庆 400065;
    2. 解放军信息工程大学, 河南郑州 450004;
    3. 78179部队, 四川成都611830;
    4. 信息保障技术重点实验室, 北京 100000
  • 收稿日期:2014-06-18 修回日期:2014-10-15 出版日期:2015-10-25
    • 通讯作者:
    • 郭建胜
    • 作者简介:
    • 黄永洪 男.1974年5月出生,重庆永川人.工程师.2000年获信息工程大学硕士学位.研究方向为信息安全和电子证据.
    • 基金资助:
    • 国家自然科学基金 (No.61272488); 博士后科学基金 (No.2014M562582)

Related-Key Impossible Differential Attacks on LBlock

HUANG Yong-hong1, GUO Jian-sheng2,4, LUO Wei3   

  1. 1. Chongqing University of Posts and Telecommunications, Chongqing 400065, China;
    2. The PLA Information Engineering University, Zhengzhou, Henan 450004, China;
    3. The PLA Unit 78179, Chengdu, Sichuan 611830, China;
    4. Science and Technology on Information Assurance Laboratory, Beijing 100000, China
  • Received:2014-06-18 Revised:2014-10-15 Online:2015-10-25 Published:2015-10-25
    • Supported by:
    • National Natural Science Foundation of China (No.61272488); China Postdoctoral Science Foundation (No.2014M562582)

摘要:

该文研究了LBlock分组密码算法在相关密钥-不可能差分条件下的安全性.利用子密钥生成算法的差分信息泄漏规律,构造了多条低重量子密钥差分链,给出了15轮相关密钥-不可能差分区分器.通过扩展区分器,给出了23轮和24轮LBlock算法的相关密钥-不可能差分攻击方法.攻击所需的数据复杂度分别为265.2和265.6个选择明文,计算复杂度分别为266.2次23轮LBlock算法加密和266.6次24轮LBlock算法加密,存储复杂度分别为261.2和277.2字节存储空间.与已有结果相比,首次将针对LBlock算法的攻击扩展到了23轮和24轮.

关键词: 分组密码, 密码分析, 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 related-key impossible differential distinguisher of LBlock is presented.By extending the distinguisher, related-key impossible differential 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 cryptanalysis of reduced-round LBlock are first extended to 23-round and 24-round in this paper.

Key words: block cipher, cryptanalysis, LBlock, related-key impossible differential attack

中图分类号: