基于中間相遇攻擊方法的分組密碼分析研究
發(fā)布時(shí)間：2019-01-10 21:52
【摘要】：20世紀(jì)以來(lái),隨著計(jì)算機(jī)技術(shù)、通信技術(shù)、互聯(lián)網(wǎng)技術(shù)的突飛猛進(jìn)和電子商務(wù)、網(wǎng)上銀行等的興起,信息安全受到越來(lái)越廣泛的關(guān)注,同時(shí)隨著物聯(lián)網(wǎng)、無(wú)線(xiàn)傳感器、RFID標(biāo)簽的出現(xiàn),分組密碼設(shè)計(jì)和分析技術(shù)高速發(fā)展,尤其是在輕量級(jí)分組方面的發(fā)展更為迅速,密碼學(xué)在信息安全領(lǐng)域越來(lái)越重要,于是,近年來(lái)提出了許多適用于資源受限環(huán)境下的輕量級(jí)分組密碼算法,例如LBLOCK,PRESENT,KATAN及KTANTAN,SIMON及SIPECK等等。本文主要對(duì)LBLOCK算法及KATAN和KTANTAN算法進(jìn)行分析,LBLOCK算法是吳文玲和張蕾提出的基于Feistel結(jié)構(gòu)的主密鑰為80比特的輕量級(jí)分組密碼,KATAN和KTANTAN算法是Christophe De Cannière和Orr Dunkelman采用流密碼中常用的非線(xiàn)性移位寄存器而設(shè)計(jì)的輕量級(jí)分組密碼。同時(shí),與密碼設(shè)計(jì)相對(duì)應(yīng)的密碼分析學(xué)的發(fā)展也十分迅速。最常用于分析分組密碼的兩種方法是差分分析和線(xiàn)性分析。本文使用Diffie和Hellman提出的中間相遇攻擊方法對(duì)LBLOCK算法進(jìn)行安全性分析,使用代數(shù)方法對(duì)KATAN和KTANTAN算法中間相遇攻擊的中間匹配階段進(jìn)行分析。本文主要做了以下幾方面的工作:1本文開(kāi)始對(duì)密碼學(xué)的發(fā)展歷程做了簡(jiǎn)要介紹,對(duì)密碼設(shè)計(jì)和密碼分析相互對(duì)立相互促進(jìn)有了新的認(rèn)識(shí),隨著技術(shù)的更新,對(duì)密碼學(xué)提出了新的要求,隨之新的加密方法陸續(xù)提出,與此同時(shí),密碼分析學(xué)的發(fā)展齊頭并進(jìn),新的分析方法不斷涌現(xiàn)。對(duì)分組密碼的兩種結(jié)構(gòu)Feistel結(jié)構(gòu)和SP結(jié)構(gòu)做了詳細(xì)介紹。2對(duì)中間相遇攻擊方法進(jìn)行了詳細(xì)介紹,其本質(zhì)是將一個(gè)完整的復(fù)雜算法,劃分為兩個(gè)連續(xù)的部分,向前加密部分和向后解密部分,并對(duì)這兩部分單獨(dú)進(jìn)行安全性分析,然后在中間某一輪進(jìn)行中間匹配過(guò)程,如果兩個(gè)部分能夠匹配,則所猜測(cè)的密碼為候選密鑰,否則,猜測(cè)的密鑰是錯(cuò)誤密鑰,予以篩除。3對(duì)LBLOCK算法進(jìn)行中間相遇攻擊,發(fā)現(xiàn)其算法本身因?yàn)榛跀U(kuò)散性較低的Feistel結(jié)構(gòu),所以算法的擴(kuò)散性也比較低。雖然密鑰編排中循環(huán)左移29比特破壞了移位后的對(duì)稱(chēng)性,而且每三輪主密鑰就全部調(diào)用一次,密鑰編排擴(kuò)散性較高。因此本文對(duì)LBLOCK算法的中間相遇攻擊輪數(shù)僅達(dá)到9輪,在使用了剪切-拼接技術(shù)以后擴(kuò)展到10輪。4在對(duì)KTANTAN32算法的密鑰編排分析,發(fā)現(xiàn)其對(duì)主密鑰的調(diào)用并不均勻,有些比特的主密鑰在100輪之后才被初次使用,很適合使用中間相遇攻擊進(jìn)行分析,再對(duì)KTANTAN32算法的中間相遇攻擊中的中間匹配階段使用單密鑰代數(shù)分析方法進(jìn)行間接匹配,達(dá)到降低其復(fù)雜性,增加了匹配的位數(shù)。
[Abstract]:Since the 20th century, with the rapid development of computer technology, communication technology, Internet technology and the rise of electronic commerce and online banking, information security has been paid more and more attention. At the same time, with the Internet of things, wireless sensors, With the emergence of RFID tags and the rapid development of block cipher design and analysis technology, especially in lightweight block, cryptography is becoming more and more important in the field of information security. In recent years, many lightweight block cipher algorithms, such as LBLOCK,PRESENT,KATAN, KTANTAN,SIMON and SIPECK, have been proposed for resource constrained environments. This paper mainly analyzes the LBLOCK algorithm and the KATAN and KTANTAN algorithms. The LBLOCK algorithm is a lightweight block cipher with 80 bits master key based on Feistel structure proposed by Wu Wenling and Zhang Lei. KATAN and KTANTAN algorithms are lightweight block ciphers designed by Christophe De Canni 貓 re and Orr Dunkelman using nonlinear shift registers commonly used in stream ciphers. At the same time, the development of cryptography corresponding to cryptographic design is very rapid. The two most commonly used methods to analyze block ciphers are differential analysis and linear analysis. In this paper, the security of LBLOCK algorithm is analyzed by using the middle encounter attack method proposed by Diffie and Hellman, and the intermediate matching stage of KATAN and KTANTAN algorithm is analyzed by algebraic method. The main work of this paper is as follows: 1 this paper begins with a brief introduction to the development of cryptography, and has a new understanding of the opposition and mutual promotion of cryptography design and cryptography analysis, with the updating of technology. At the same time, the development of cryptography is in step with the development of cryptography, and new methods of analysis are emerging. In this paper, two kinds of Feistel structure and SP structure of block cipher are introduced in detail. 2 the middle encounter attack method is introduced in detail. In essence, a complete complex algorithm is divided into two consecutive parts. The forward encryption part and the backward decryption part are analyzed separately, and then the intermediate matching process is carried out in the middle round. If the two parts can match, the password is a candidate key, otherwise, The speculated key is the wrong key, and the middle encounter attack of the LBLOCK algorithm is eliminated. It is found that the algorithm itself is based on the low diffusivity of the Feistel structure, so the diffusivity of the algorithm is also relatively low. Although the shift of 29 bits to the left in key choreography breaks the symmetry after shift, and every three rounds of master keys are called once, the diffusion of key choreography is high. Therefore, in this paper, the number of intermediate encounter attack rounds of LBLOCK algorithm is only 9 rounds, which is extended to 10 rounds after using shear-splicing technology. 4 the key arrangement analysis of KTANTAN32 algorithm shows that the calling of master key is not uniform. The master key of some bits is first used after 100 rounds, so it is very suitable to use the intermediate encounter attack to analyze, and then use the single-secret key algebra analysis method to indirectly match the intermediate matching phase of the middle encounter attack of KTANTAN32 algorithm. To reduce its complexity and increase the number of matching bits.
【學(xué)位授予單位】：山東師范大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2016
【分類(lèi)號(hào)】：TP309
，
本文編號(hào)：2406823
[Abstract]:Since the 20th century, with the rapid development of computer technology, communication technology, Internet technology and the rise of electronic commerce and online banking, information security has been paid more and more attention. At the same time, with the Internet of things, wireless sensors, With the emergence of RFID tags and the rapid development of block cipher design and analysis technology, especially in lightweight block, cryptography is becoming more and more important in the field of information security. In recent years, many lightweight block cipher algorithms, such as LBLOCK,PRESENT,KATAN, KTANTAN,SIMON and SIPECK, have been proposed for resource constrained environments. This paper mainly analyzes the LBLOCK algorithm and the KATAN and KTANTAN algorithms. The LBLOCK algorithm is a lightweight block cipher with 80 bits master key based on Feistel structure proposed by Wu Wenling and Zhang Lei. KATAN and KTANTAN algorithms are lightweight block ciphers designed by Christophe De Canni 貓 re and Orr Dunkelman using nonlinear shift registers commonly used in stream ciphers. At the same time, the development of cryptography corresponding to cryptographic design is very rapid. The two most commonly used methods to analyze block ciphers are differential analysis and linear analysis. In this paper, the security of LBLOCK algorithm is analyzed by using the middle encounter attack method proposed by Diffie and Hellman, and the intermediate matching stage of KATAN and KTANTAN algorithm is analyzed by algebraic method. The main work of this paper is as follows: 1 this paper begins with a brief introduction to the development of cryptography, and has a new understanding of the opposition and mutual promotion of cryptography design and cryptography analysis, with the updating of technology. At the same time, the development of cryptography is in step with the development of cryptography, and new methods of analysis are emerging. In this paper, two kinds of Feistel structure and SP structure of block cipher are introduced in detail. 2 the middle encounter attack method is introduced in detail. In essence, a complete complex algorithm is divided into two consecutive parts. The forward encryption part and the backward decryption part are analyzed separately, and then the intermediate matching process is carried out in the middle round. If the two parts can match, the password is a candidate key, otherwise, The speculated key is the wrong key, and the middle encounter attack of the LBLOCK algorithm is eliminated. It is found that the algorithm itself is based on the low diffusivity of the Feistel structure, so the diffusivity of the algorithm is also relatively low. Although the shift of 29 bits to the left in key choreography breaks the symmetry after shift, and every three rounds of master keys are called once, the diffusion of key choreography is high. Therefore, in this paper, the number of intermediate encounter attack rounds of LBLOCK algorithm is only 9 rounds, which is extended to 10 rounds after using shear-splicing technology. 4 the key arrangement analysis of KTANTAN32 algorithm shows that the calling of master key is not uniform. The master key of some bits is first used after 100 rounds, so it is very suitable to use the intermediate encounter attack to analyze, and then use the single-secret key algebra analysis method to indirectly match the intermediate matching phase of the middle encounter attack of KTANTAN32 algorithm. To reduce its complexity and increase the number of matching bits.
【學(xué)位授予單位】：山東師范大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2016
【分類(lèi)號(hào)】：TP309
，
本文編號(hào)：2406823
本文鏈接：http://www.sikaile.net/jingjilunwen/dianzishangwulunwen/2406823.html
最近更新
教材專(zhuān)著
