對SPECK系列分組密碼算法的零相關(guān)線性分析
發(fā)布時間：2018-09-19 06:23
【摘要】：SPECK系列密碼算法是由Ray Beaulieu等人在2013年提出的輕量級分組密碼算法,該算法由簡單的基本運算構(gòu)成。SPECK輕量級分組密碼算法的分組長度為32、48、64、96或128比特,密鑰長度為64、72、96、128、144、192或256比特,即分組長度和密鑰長度是非固定的。SPECK系列分組密碼算法給出了10個應(yīng)用實例,可以根據(jù)具體的安全性要求、性能要求、應(yīng)用環(huán)境等選擇合適的分組長度和密鑰長度,具有很強的靈活性,應(yīng)用前景十分廣泛。本論文首先詳細介紹了SPECK系列分組密碼算法。該算法的輪函數(shù)結(jié)構(gòu)較簡單,主要由循環(huán)移位操作、異或運算和域上的模加運算組成；而算法的密鑰擴展函數(shù)也調(diào)用了輪函數(shù),這使得SPECK系列算法的加密效率很高,有利于進行軟件實現(xiàn)。針對SPECK系列密碼算法已經(jīng)有了一些安全性分析結(jié)果,如Farzaneh Abed等人提出的飛去來器攻擊和矩形攻擊、Alex Biryukov等人提出的差分攻擊以及由Itai Dinur改進的差分攻擊等,本文主要利用零相關(guān)線性分析的方法,對SPECK系列密碼算法進行安全性分析。零相關(guān)線性分析首先由Bogdanov和Rijmen在2012年提出,是一種針對分組密碼算法的新型攻擊,主要利用相關(guān)性為零的線性逼近,而線性相關(guān)性與線性逼近成立的概率相關(guān)。最初的零相關(guān)分析的數(shù)據(jù)復(fù)雜度較高,限制了其進一步的發(fā)展和應(yīng)用。但在2012年FSE會議和亞密會議中,先后提出了對零相關(guān)線性分析的數(shù)據(jù)復(fù)雜度的改進方法。多維區(qū)分器的引入,避免了一些不必要的獨立性假設(shè),使得零相關(guān)分析能夠更好的實現(xiàn)。根據(jù)零相關(guān)線性分析的原理,結(jié)合SPECK系列分組密碼算法的結(jié)構(gòu)特點,我們找到了SPECK 32/64的一個6輪的零相關(guān)線性路徑,利用傳統(tǒng)的零相關(guān)線性分析方法,對11輪的SPECK 32/64算法進行安全性分析。由于猜測的密鑰比特較多,需要建立計數(shù)器,逐步猜測各個密鑰比特,以便把攻擊的時間復(fù)雜度控制在一定的范圍內(nèi),論文中給出了詳細的攻擊過程和復(fù)雜度分析。同時,我們根據(jù)觀察到的SPECK算法的輪函數(shù)特征,結(jié)合SPECK 48/96算法的具體參數(shù)設(shè)置,對SPECK 48/96算法也進行了零相關(guān)線性分析,并給出了詳細的攻擊過程和復(fù)雜度分析。
[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
【相似文獻】
相關(guān)期刊論文 前10條
1 孫紅波;傅仕諍;徐日;;分組密碼算法的基礎(chǔ)平臺研究[J];無線電工程;2014年01期
2 雷旭,徐重陽;一種新的對稱分組密碼算法的設(shè)計[J];電視技術(shù);2002年05期
3 李順東,覃征,王向華,賈曉琳;面向移動商務(wù)的分組密碼算法[J];西安交通大學學報;2003年08期
4 尤坤,呂永其;分組密碼算法芯片驗證[J];通信技術(shù);2003年11期
5 王勇 ,陳小平;一種以移位為基礎(chǔ)的分組密碼算法[J];信息網(wǎng)絡(luò)安全;2004年12期
6 彭巍,周亮;分組密碼算法測試平臺設(shè)計[J];成都信息工程學院學報;2005年05期
7 孫旭;李雪梅;魯長江;;分組密碼算法的研究與實現(xiàn)[J];成都理工大學學報(自然科學版);2006年06期
8 yど僖，
本文編號：2249307
本文鏈接：http://sikaile.net/kejilunwen/wltx/2249307.html
最近更新
教材專著
