LBlock算法的改进中间相遇攻击
发布时间：2018-10-09 14:01
【摘要】：LBlock算法是2011年在ACNS会议上提出的轻量级分组密码算法,目前已存在17轮、19轮LBlock算法的中间相遇攻击.文中评估LBlock算法在预建表中间相遇攻击下的安全性.预建表中间相遇攻击提出并发展于AES算法(高级加密标准)的安全性分析,是近些年密码分析中的一个研究热点.预建表中间相遇攻击属于典型的区分器类攻击,包含离线和在线两个阶段.文中通过综合离线阶段区分器的建立过程和在线阶段密钥的恢复过程,利用程序搜索LBlock算法有效区分器与对应初始密钥的最优攻击参数.结果表明,LBlock算法存在11轮区分器,21轮LBlock算法不抵抗预建表中间相遇攻击,攻击的数据复杂度仅为2~(34.1)选择明文,计算复杂度为2~(75.8)次21轮加密,存储复杂度为2~(74.8)个64比特块.与LBlock算法已有中间相遇攻击相比,文中将攻击轮数由19轮扩展至21轮,刷新了LBlock算法在中间相遇攻击下的安全性评估结果.与不可能差分、积分分析等其他分析结果相比,文中攻击具有显著的低数据复杂度,在实际攻击环境下具有重要意义.此外,为了提高LBlock密钥扩展算法的扩散速度,汪艳凤等人提出了一种新的密钥扩展算法.文中评估了采用新的密钥扩展算法的LBlock在预建表中间相遇攻击下的安全性,并成功得到了复杂度优于穷举搜索的20轮攻击,结果显示新的密钥扩展算法以1轮的优势增强了LBlock算法抵抗此类攻击的能力.
[Abstract]:LBlock algorithm is a lightweight block cipher algorithm proposed at the ACNS conference in 2011. At present, there are 17 rounds of 19 rounds of LBlock algorithm in the middle of the encounter attack. This paper evaluates the security of the LBlock algorithm under the encounter attack in the middle of the pre-built table. The security analysis of pre-built table intermediate encounter attack developed from AES (Advanced encryption Standard) is a hot topic in cryptographic analysis in recent years. The pre-built table encounter attack is a typical discriminator attack, which includes two stages: offline and online. By synthesizing the building process of off-line phase discriminator and the restoration process of online key, the LBlock algorithm is used to search the optimal attack parameters of the discriminator and the corresponding initial key. The results show that the LBlock algorithm has 11 rounds of discriminator and 21 rounds of LBlock, and the data complexity of the attack is only 2 ~ (34.1) selected plaintext, the computational complexity is 2 ~ (75.8) times 21 rounds of encryption, and the storage complexity is 2 ~ (74.8) 64 bits. Compared with the existing intermediate encounter attack of LBlock algorithm, the number of attack rounds is extended from 19 to 21 rounds, which refreshes the security evaluation results of LBlock algorithm under the intermediate encounter attack. Compared with other analysis results, such as impossible difference analysis and integral analysis, the attack in this paper has significant low data complexity and is of great significance in the actual attack environment. In addition, in order to improve the diffusion speed of LBlock key extension algorithm, Wang Yanfeng and others proposed a new key extension algorithm. In this paper, we evaluate the security of LBlock with a new key extension algorithm under the encounter attack of pre-built table, and obtain 20 attacks whose complexity is better than that of exhaustive search. The results show that the new key extension algorithm enhances the ability of LBlock algorithm to resist such attacks by one round.
【作者单位】： 中国科学院软件研究所可信计算与信息保障实验室;中国科学院大学研究生院;
【基金】：国家“九七三”重点基础研究发展规划项目基金(2013CB338002) 国家自然科学基金(61272476,61672509,61232009)资助~~
【分类号】：TN918.1
本文编号：2259605
[Abstract]:LBlock algorithm is a lightweight block cipher algorithm proposed at the ACNS conference in 2011. At present, there are 17 rounds of 19 rounds of LBlock algorithm in the middle of the encounter attack. This paper evaluates the security of the LBlock algorithm under the encounter attack in the middle of the pre-built table. The security analysis of pre-built table intermediate encounter attack developed from AES (Advanced encryption Standard) is a hot topic in cryptographic analysis in recent years. The pre-built table encounter attack is a typical discriminator attack, which includes two stages: offline and online. By synthesizing the building process of off-line phase discriminator and the restoration process of online key, the LBlock algorithm is used to search the optimal attack parameters of the discriminator and the corresponding initial key. The results show that the LBlock algorithm has 11 rounds of discriminator and 21 rounds of LBlock, and the data complexity of the attack is only 2 ~ (34.1) selected plaintext, the computational complexity is 2 ~ (75.8) times 21 rounds of encryption, and the storage complexity is 2 ~ (74.8) 64 bits. Compared with the existing intermediate encounter attack of LBlock algorithm, the number of attack rounds is extended from 19 to 21 rounds, which refreshes the security evaluation results of LBlock algorithm under the intermediate encounter attack. Compared with other analysis results, such as impossible difference analysis and integral analysis, the attack in this paper has significant low data complexity and is of great significance in the actual attack environment. In addition, in order to improve the diffusion speed of LBlock key extension algorithm, Wang Yanfeng and others proposed a new key extension algorithm. In this paper, we evaluate the security of LBlock with a new key extension algorithm under the encounter attack of pre-built table, and obtain 20 attacks whose complexity is better than that of exhaustive search. The results show that the new key extension algorithm enhances the ability of LBlock algorithm to resist such attacks by one round.
【作者单位】： 中国科学院软件研究所可信计算与信息保障实验室;中国科学院大学研究生院;
【基金】：国家“九七三”重点基础研究发展规划项目基金(2013CB338002) 国家自然科学基金(61272476,61672509,61232009)资助~~
【分类号】：TN918.1
【相似文献】
相关期刊论文 前3条
1 杜钦生,王美琴,曹宝香;Rijndael加密算法的密钥扩展算法的研究[J];信息技术与信息化;2005年05期
2 李政;;基于Feistel网络的AES密钥扩展算法[J];计算机与现代化;2007年09期
3 ;[J];;年期
相关会议论文 前1条
1 罗春丽;林胜钊;张鸿飞;崔珂;王坚;;基于Hash函数的安全密钥扩展算法的研究[A];第十六届全国核电子学与核探测技术学术年会论文集（上册）[C];2012年
相关硕士学位论文 前3条
1 贺亮;RC4密钥扩展算法的不动点数分析[D];青岛大学;2008年
2 袁巍;AES算法的设计原则与其密钥扩展算法的改进[D];吉林大学;2010年
3 闫智佳;IDEA子密钥扩展算法的分析及改进[D];吉林大学;2012年
，本文编号：2259605
本文链接：https://www.wllwen.com/kejilunwen/xinxigongchenglunwen/2259605.html
