基于中间相遇攻击方法的分组密码分析研究
发布时间：2019-01-10 21:52
【摘要】：20世纪以来,随着计算机技术、通信技术、互联网技术的突飞猛进和电子商务、网上银行等的兴起,信息安全受到越来越广泛的关注,同时随着物联网、无线传感器、RFID标签的出现,分组密码设计和分析技术高速发展,尤其是在轻量级分组方面的发展更为迅速,密码学在信息安全领域越来越重要,于是,近年来提出了许多适用于资源受限环境下的轻量级分组密码算法,例如LBLOCK,PRESENT,KATAN及KTANTAN,SIMON及SIPECK等等。本文主要对LBLOCK算法及KATAN和KTANTAN算法进行分析,LBLOCK算法是吴文玲和张蕾提出的基于Feistel结构的主密钥为80比特的轻量级分组密码,KATAN和KTANTAN算法是Christophe De Cannière和Orr Dunkelman采用流密码中常用的非线性移位寄存器而设计的轻量级分组密码。同时,与密码设计相对应的密码分析学的发展也十分迅速。最常用于分析分组密码的两种方法是差分分析和线性分析。本文使用Diffie和Hellman提出的中间相遇攻击方法对LBLOCK算法进行安全性分析,使用代数方法对KATAN和KTANTAN算法中间相遇攻击的中间匹配阶段进行分析。本文主要做了以下几方面的工作:1本文开始对密码学的发展历程做了简要介绍,对密码设计和密码分析相互对立相互促进有了新的认识,随着技术的更新,对密码学提出了新的要求,随之新的加密方法陆续提出,与此同时,密码分析学的发展齐头并进,新的分析方法不断涌现。对分组密码的两种结构Feistel结构和SP结构做了详细介绍。2对中间相遇攻击方法进行了详细介绍,其本质是将一个完整的复杂算法,划分为两个连续的部分,向前加密部分和向后解密部分,并对这两部分单独进行安全性分析,然后在中间某一轮进行中间匹配过程,如果两个部分能够匹配,则所猜测的密码为候选密钥,否则,猜测的密钥是错误密钥,予以筛除。3对LBLOCK算法进行中间相遇攻击,发现其算法本身因为基于扩散性较低的Feistel结构,所以算法的扩散性也比较低。虽然密钥编排中循环左移29比特破坏了移位后的对称性,而且每三轮主密钥就全部调用一次,密钥编排扩散性较高。因此本文对LBLOCK算法的中间相遇攻击轮数仅达到9轮,在使用了剪切-拼接技术以后扩展到10轮。4在对KTANTAN32算法的密钥编排分析,发现其对主密钥的调用并不均匀,有些比特的主密钥在100轮之后才被初次使用,很适合使用中间相遇攻击进行分析,再对KTANTAN32算法的中间相遇攻击中的中间匹配阶段使用单密钥代数分析方法进行间接匹配,达到降低其复杂性,增加了匹配的位数。
[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.
【学位授予单位】：山东师范大学
【学位级别】：硕士
【学位授予年份】：2016
【分类号】：TP309
，
本文编号：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.
【学位授予单位】：山东师范大学
【学位级别】：硕士
【学位授予年份】：2016
【分类号】：TP309
，
本文编号：2406823
本文链接：https://www.wllwen.com/jingjilunwen/dianzishangwulunwen/2406823.html
