对SPECK系列分组密码算法的零相关线性分析
发布时间：2018-09-19 06:23
【摘要】：SPECK系列密码算法是由Ray Beaulieu等人在2013年提出的轻量级分组密码算法,该算法由简单的基本运算构成。SPECK轻量级分组密码算法的分组长度为32、48、64、96或128比特,密钥长度为64、72、96、128、144、192或256比特,即分组长度和密钥长度是非固定的。SPECK系列分组密码算法给出了10个应用实例,可以根据具体的安全性要求、性能要求、应用环境等选择合适的分组长度和密钥长度,具有很强的灵活性,应用前景十分广泛。本论文首先详细介绍了SPECK系列分组密码算法。该算法的轮函数结构较简单,主要由循环移位操作、异或运算和域上的模加运算组成；而算法的密钥扩展函数也调用了轮函数,这使得SPECK系列算法的加密效率很高,有利于进行软件实现。针对SPECK系列密码算法已经有了一些安全性分析结果,如Farzaneh Abed等人提出的飞去来器攻击和矩形攻击、Alex Biryukov等人提出的差分攻击以及由Itai Dinur改进的差分攻击等,本文主要利用零相关线性分析的方法,对SPECK系列密码算法进行安全性分析。零相关线性分析首先由Bogdanov和Rijmen在2012年提出,是一种针对分组密码算法的新型攻击,主要利用相关性为零的线性逼近,而线性相关性与线性逼近成立的概率相关。最初的零相关分析的数据复杂度较高,限制了其进一步的发展和应用。但在2012年FSE会议和亚密会议中,先后提出了对零相关线性分析的数据复杂度的改进方法。多维区分器的引入,避免了一些不必要的独立性假设,使得零相关分析能够更好的实现。根据零相关线性分析的原理,结合SPECK系列分组密码算法的结构特点,我们找到了SPECK 32/64的一个6轮的零相关线性路径,利用传统的零相关线性分析方法,对11轮的SPECK 32/64算法进行安全性分析。由于猜测的密钥比特较多,需要建立计数器,逐步猜测各个密钥比特,以便把攻击的时间复杂度控制在一定的范围内,论文中给出了详细的攻击过程和复杂度分析。同时,我们根据观察到的SPECK算法的轮函数特征,结合SPECK 48/96算法的具体参数设置,对SPECK 48/96算法也进行了零相关线性分析,并给出了详细的攻击过程和复杂度分析。
[Abstract]:SPECK series cipher algorithm is a lightweight block cipher algorithm proposed by Ray Beaulieu et al in 2013. The algorithm is composed of simple basic operations. The block length of .SPECK lightweight block cipher algorithm is 32pc 48CX 64996 or 128bit, and the key length is 64O72C 96128144192 or 256bit. That is, the block length and key length of the .SPECK series block cipher are not fixed. Ten application examples are given, which can select the appropriate block length and key length according to the specific security requirements, performance requirements, application environment, etc. Has very strong flexibility, the application prospect is very widespread. In this paper, SPECK series block cipher algorithms are introduced in detail. The algorithm is composed of cyclic shift operation, XOR operation and modular addition operation in the domain, and the key extension function of the algorithm also calls the wheel function, which makes the encryption efficiency of SPECK series algorithm very high. It is favorable for software realization. Some security analysis results have been obtained for SPECK series cryptographic algorithms, such as the fly away attack proposed by Farzaneh Abed et al., the rectangular attack and the differential attack by Biryukov et al., and the differential attack improved by Itai Dinur, etc. This paper mainly uses the method of zero correlation linear analysis to analyze the security of SPECK series cipher algorithms. The zero-correlation linear analysis, first proposed by Bogdanov and Rijmen in 2012, is a new attack against block cipher algorithm, which mainly uses linear approximation with zero correlation, and linear correlation is correlated with probability of linear approximation. The high data complexity of the initial zero correlation analysis limits its further development and application. However, in the 2012 FSE conference and the Yami conference, an improved method for the data complexity of zero correlation linear analysis was proposed. The introduction of multidimensional discriminator avoids some unnecessary independence assumptions and makes zero correlation analysis better. According to the principle of zero correlation linear analysis and the structural characteristics of SPECK series block cipher algorithm, we find a 6 round zero correlation linear path of SPECK 32 / 64, and use the traditional zero correlation linear analysis method. The security of 11 rounds of SPECK 32 / 64 algorithm is analyzed. Due to the large number of key bits, it is necessary to set up a counter and guess each key bit step by step, so that the time complexity of the attack can be controlled within a certain range. In this paper, the attack process and complexity analysis are given in detail. At the same time, according to the observed wheel function characteristics of SPECK algorithm and the specific parameter setting of SPECK 48 / 96 algorithm, the zero-correlation linear analysis of SPECK 48 / 96 algorithm is carried out, and the attack process and complexity analysis are given in detail.
【学位授予单位】：山东大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：TN918.1
[Abstract]:SPECK series cipher algorithm is a lightweight block cipher algorithm proposed by Ray Beaulieu et al in 2013. The algorithm is composed of simple basic operations. The block length of .SPECK lightweight block cipher algorithm is 32pc 48CX 64996 or 128bit, and the key length is 64O72C 96128144192 or 256bit. That is, the block length and key length of the .SPECK series block cipher are not fixed. Ten application examples are given, which can select the appropriate block length and key length according to the specific security requirements, performance requirements, application environment, etc. Has very strong flexibility, the application prospect is very widespread. In this paper, SPECK series block cipher algorithms are introduced in detail. The algorithm is composed of cyclic shift operation, XOR operation and modular addition operation in the domain, and the key extension function of the algorithm also calls the wheel function, which makes the encryption efficiency of SPECK series algorithm very high. It is favorable for software realization. Some security analysis results have been obtained for SPECK series cryptographic algorithms, such as the fly away attack proposed by Farzaneh Abed et al., the rectangular attack and the differential attack by Biryukov et al., and the differential attack improved by Itai Dinur, etc. This paper mainly uses the method of zero correlation linear analysis to analyze the security of SPECK series cipher algorithms. The zero-correlation linear analysis, first proposed by Bogdanov and Rijmen in 2012, is a new attack against block cipher algorithm, which mainly uses linear approximation with zero correlation, and linear correlation is correlated with probability of linear approximation. The high data complexity of the initial zero correlation analysis limits its further development and application. However, in the 2012 FSE conference and the Yami conference, an improved method for the data complexity of zero correlation linear analysis was proposed. The introduction of multidimensional discriminator avoids some unnecessary independence assumptions and makes zero correlation analysis better. According to the principle of zero correlation linear analysis and the structural characteristics of SPECK series block cipher algorithm, we find a 6 round zero correlation linear path of SPECK 32 / 64, and use the traditional zero correlation linear analysis method. The security of 11 rounds of SPECK 32 / 64 algorithm is analyzed. Due to the large number of key bits, it is necessary to set up a counter and guess each key bit step by step, so that the time complexity of the attack can be controlled within a certain range. In this paper, the attack process and complexity analysis are given in detail. At the same time, according to the observed wheel function characteristics of SPECK algorithm and the specific parameter setting of SPECK 48 / 96 algorithm, the zero-correlation linear analysis of SPECK 48 / 96 algorithm is carried out, and the attack process and complexity analysis are given in detail.
【学位授予单位】：山东大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：TN918.1
【相似文献】
相关期刊论文 前10条
1 孙红波;傅仕诤;徐日;;分组密码算法的基础平台研究[J];无线电工程;2014年01期
2 雷旭,徐重阳;一种新的对称分组密码算法的设计[J];电视技术;2002年05期
3 李顺东,覃征,王向华,贾晓琳;面向移动商务的分组密码算法[J];西安交通大学学报;2003年08期
4 尤坤,吕永其;分组密码算法芯片验证[J];通信技术;2003年11期
5 王勇 ,陈小平;一种以移位为基础的分组密码算法[J];信息网络安全;2004年12期
6 彭巍,周亮;分组密码算法测试平台设计[J];成都信息工程学院学报;2005年05期
7 孙旭;李雪梅;鲁长江;;分组密码算法的研究与实现[J];成都理工大学学报(自然科学版);2006年06期
8 yど僖，
本文编号：2249307
本文链接：https://www.wllwen.com/kejilunwen/wltx/2249307.html
