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

doi:10.3969/j.issn.0372-2112.2015.10.011

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

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

黄永洪¹, 郭建胜^2,4, 罗伟³

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-hong¹, GUO Jian-sheng^2,4, LUO Wei³

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)

摘要/Abstract

摘要：

该文研究了LBlock分组密码算法在相关密钥-不可能差分条件下的安全性.利用子密钥生成算法的差分信息泄漏规律,构造了多条低重量子密钥差分链,给出了15轮相关密钥-不可能差分区分器.通过扩展区分器,给出了23轮和24轮LBlock算法的相关密钥-不可能差分攻击方法.攻击所需的数据复杂度分别为2^65.2和2^65.6个选择明文,计算复杂度分别为2^66.2次23轮LBlock算法加密和2^66.6次24轮LBlock算法加密,存储复杂度分别为2^61.2和2^77.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 2^65.2 and 2^65.6 chosen-plain-text, respectively;the computing complexities of the attacks are 2^66.2 23-round LBlock encryptions and 2^66.6 24-round LBlock encryptions, respectively;the storage complexities of the attacks are 2^61.2 and 2^77.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

中图分类号:

TN918.1

黄永洪, 郭建胜, 罗伟. LBlock算法的相关密钥-不可能差分攻击[J]. 电子学报, 2015, 43(10): 1948-1953.

HUANG Yong-hong, GUO Jian-sheng, LUO Wei . Related-Key Impossible Differential Attacks on LBlock[J]. Acta Electronica Sinica, 2015, 43(10): 1948-1953.

参考文献

[1] Gong Z,Nikove S,Law Y W.KLEIN:a new family of lightweight block ciphers [J].RFID Security and Privacy,2012,LNCS 7055:1-18.
[2] Guo J,Peyein T,Poschmann A,et al.The LED block cipher[A].CHES 2011[C].Nara,Japan,LNCS 6917,2011.326-341.
[3] Knudsen L,Leander G,Poschmann A,et al.PRINTcipher:a block cipher for IC-Printing[A].CHES 2010[C].Santa Barbara,USA,LNCS 6225,2010.16-32.
[4] Shibutani K,Isobe T,Hiwatari H,et al.Piccolo:an ultra-lightweight block cipher[A].CHES 2011[C].Nara,Japan,LNCS 6917,2011.342-357.
[5] Borghoff J,Canteaut A,Güneysu T,et al.PRINCE-a low-latency block cipher for pervasive computing applications[A].ASIACRYPT 2012[C].Beijing,China,LNCS 7658,2012.208-225.
[6] 罗伟,郭建胜.Cobra-H64/128算法的相关密钥-差分攻击[J].电子学报,2013,41(8):1569-1573. LUO Wei,GUO Jiansheng.Related-key differential attack on Cobra-H64[J].Acta Electronica Sinica,2013,41(8):1569-1573.(in Chinese)
[7] Hu Z,Qin Z.Related key impossible differential cryptanalysis of AES-256[J].International Journal of Advancements in Computing Technology,2012,4(3):91-98.
[8] Ding Lin,Guan Jie.Related-key chosen IV attack on K2[J].Chinese Journal of Electronics,2011,20(2):365-369.
[9] Wu W L,Zhang L.LBlock:a lightweight block cipher[A].ANCS 2011[C].Nerja,Spain,LNCS 6715,2011.327-344.
[10] Liu Y,Gu D,Liu Z,et al.Impossible differential attacks on reduced-round LBlock[A].ISPEC 2012[C].Hangzhou,China,LNCS 7232,2012.97-108.
[11] Karakoc F,Demirci H,Harmanca E.Impossible differential cryptanalysis of reduced-round LBlock[A].WISTP 2012[C].Egham,UK,LNCS 7322,2012.179-188.
[12] 郭建胜,罗伟,张磊,等.LBLock码的不可能差分密码性能分析[J].电子与信息学报,2013,35(6):1516-1519. Guo Jiansheng,Luo Wei,Zhang Lei,et al.Impossible differential cryptanalysis of LBlock code[J].Journal of Electronics & Information Technology,2013,35(6):1516-1519.(in Chinese)
[13] Minier M,Naya-plasencia M.A related key impossible differential attack against 22 rounds of the lightweight block cipher LBlock[J].Information Processing Letters,2012,112(16):624-629.
[14] Lu J,Kim J,Nathan K,et al.Improving the efficiency of impossible differential cryptanalysis of reduced Camellia and MISTY1[A].RSA 2008[C].San Francisco,CA,USA,LNCS 4964,2008.370-386.

[1]	王安, 谷睿, 丁瑶玲, 张雪, 袁庆军, 祝烈煌. 基于持续性故障的分组密码算法S盒表逆向分析[J]. 电子学报, 2023, 51(3): 537-551.
[2]	欧庆于, 罗芳, 吴晓平, 杨鹏. 基于电压毛刺故障扰动的分组密码安全性度量方法研究[J]. 电子学报, 2021, 49(3): 417-423.
[3]	杨继林, 王念平. 类CLEFIA动态密码结构抵抗差分密码分析能力评估[J]. 电子学报, 2021, 49(11): 2279-2283.
[4]	马宿东, 金晨辉, 关杰. 一类ARIA型扩散结构分支数的研究[J]. 电子学报, 2020, 48(3): 449-455.
[5]	李航, 任炯炯, 陈少真. 减轮LEA密码算法的积分攻击[J]. 电子学报, 2020, 48(1): 17-27.
[6]	王念平. 一类分组密码变换簇抵抗线性密码分析的安全性评估[J]. 电子学报, 2020, 48(1): 137-142.
[7]	杜怡然, 南龙梅, 戴紫彬, 李伟. 可重构分组密码逻辑阵列加权度量模型及高能效映射算法[J]. 电子学报, 2019, 47(1): 82-91.
[8]	冯晓, 李伟, 戴紫彬, 马超, 李功丽. 面向分组密码的可重构异构多核并行处理架构[J]. 电子学报, 2017, 45(6): 1311-1320.
[9]	魏长河, 李俊志, 张少武. 对288轮Trivium算法的线性分析[J]. 电子学报, 2017, 45(6): 1456-1461.
[10]	贾平, 徐洪, 来学嘉. LBlock-s算法的不可能差分分析[J]. 电子学报, 2017, 45(4): 966-973.
[11]	王寿成, 严迎建, 徐进辉. 基于流体系结构的高效能分组密码处理器研究[J]. 电子学报, 2017, 45(4): 937-943.
[12]	伊文坛, 田亚, 陈少真. 减缩轮PRIDE算法的线性分析[J]. 电子学报, 2017, 45(2): 468-476.
[13]	王寿成, 李功丽, 严迎建, 徐进辉. 面向分组密码的四维度并行处理架构研究[J]. 电子学报, 2017, 45(10): 2457-2463.
[14]	李浪, 李肯立, 贺位位, 邹祎, 刘波涛. Magpie:一种高安全的轻量级分组密码算法[J]. 电子学报, 2017, 45(10): 2521-2527.
[15]	王念平. 四分组类CLEFIA变换簇抵抗差分密码分析的安全性评估[J]. 电子学报, 2017, 45(10): 2528-2532.

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

Related-Key Impossible Differential Attacks on LBlock

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics