LBlock算法的相关密钥不可能差分分析

发布时间：2018-04-06 03:29

本文选题：LBlock　切入点：分组密码　出处：《计算机研究与发展》2014年07期

【摘要】：LBlock算法是2011年提出的轻量级分组密码,适用于资源受限的环境.目前,关于LBlock最好的分析结果为基于14轮不可能差分路径和15轮的相关密钥不可能差分路径,攻击的最高轮数为22轮.为研究LBlock算法抵抗不可能差分性质,结合密钥扩展算法的特点和轮函数本身的结构,构造了新的4条15轮相关密钥不可能差分路径.将15轮差分路径向前扩展4轮、向后扩展3轮,分析了22轮LBlock算法.在已有的相关密钥不可能差分攻击的基础上,深入研究了轮函数中S盒的特点,使用2类相关密钥不可能差分路径.基于部分密钥分别猜测技术降低计算量,分析22轮LBlock所需数据量为261个明文,计算量为259.58次22轮加密.
[Abstract]:LBlock algorithm is a lightweight block cipher proposed in 2011, which is suitable for resource constrained environment.At present, the best analysis results of LBlock are based on 14 rounds of impossible differential path and 15 rounds of related key impossible differential path, and the maximum number of attacks is 22 rounds.In order to study the impossibility difference property of LBlock algorithm, combined with the characteristics of key expansion algorithm and the structure of the wheel function itself, four new 15-round dependent key impossibility difference paths are constructed.The 15-wheel differential path is extended by 4 rounds forward and 3 rounds backward, and 22 rounds of LBlock algorithm is analyzed.On the basis of the existing correlation key impossibility difference attack, the characteristic of S-box in the round function is studied in depth. Using two kinds of correlation key, it is impossible to differential path.Based on the partial key guessing technique, the amount of data required for 22 rounds of LBlock is 261plaintext, and the amount of computation is 259.58 times for 22 rounds of encryption.
【作者单位】：北京科技大学数理学院;
【基金】：国家自然科学基金面上项目(61272476) 内蒙古自治区科技创新引导奖励资金项目(2012)
【分类号】：TN918.4

【参考文献】