若干分组密码不可能差分分析与中间相遇攻击研究

发布时间：2018-02-26 22:31

本文关键词： 分组密码 ARIA算法 3D算法 MISTY1算法不可能差分攻击中间相遇攻击单密钥预计算技术　出处：《解放军信息工程大学》2014年硕士论文　论文类型：学位论文

【摘要】：分组密码较其它密码算法,具有加解密速度快、易于标准化以及便于在各种软硬件平台实现等优势,这使得其广泛用于数据流加解密、身份认证、密钥分配管理等领域并担任着核心加解密算法的角色,在通信与信息安全领域有及其重要的战略地位.因此,对于分组密码的安全性分析一直是密码学乃至整个信息研究领域的研究热点.本文首先对ARIA算法和3D算法进行了不可能差分分析;其次,给出了低数据复杂度的全轮MISTY1算法的中间相遇攻击.具体研究成果如下:1.根据ARIA算法的结构特点,充分利用扩散层的相关性质,构造出扩散层的一个新的等价关系,并结合“early abort”技术、预计算技术和Hash表存储技术,实现了ARIA-192算法的7轮不可能差分攻击,并将ARIA-256攻击的时间复杂度降低为192.22.2.构造出3D算法一类新的6轮不可能差分区分器,最大程度利用Hash存储的预计算技术,首次将3D密码的不可能差分攻击扩展到11轮.同时将10轮不可能差分攻击时间复杂度降为318.82.3.根据MISTY1的FL层以及密钥扩展算法弱点,提出了MISTY1算法2个有趣的性质,并由此构造出中间相遇碰撞,并首次实现对于单密钥的全轮MISTY1攻击,需要的数据量低至1个选择明文.
[Abstract]:Compared with other cipher algorithms, block cipher has the advantages of fast encryption and decryption speed, easy standardization and easy implementation on various software and hardware platforms, which makes it widely used in data stream encryption and decryption, identity authentication, etc. Key distribution management plays a key role in encryption and decryption algorithms and plays an important strategic role in the field of communication and information security. The security analysis of block ciphers has always been a hot research topic in cryptography and even the whole information research field. Firstly, the ARIA algorithm and 3D algorithm are analyzed by impossibility difference analysis; secondly, In this paper, the middle encounter attack of full-round MISTY1 algorithm with low data complexity is given. The concrete research results are as follows: 1.According to the structural characteristics of ARIA algorithm, a new equivalent relation of diffusion layer is constructed by fully utilizing the related properties of diffusion layer. Combined with "early abort" technology, pre-computing technology and Hash table storage technology, 7 rounds of impossible differential attacks of ARIA-192 algorithm are realized, and the time complexity of ARIA-256 attacks is reduced to 192.22.2. A new 6-round impossible-differential discriminator of 3D algorithm is constructed. Based on the pre-computing technology of Hash storage, the impossible differential attacks of 3D ciphers are extended to 11 rounds for the first time. Meanwhile, the time complexity of 10 impossible-differential attacks is reduced to 318.82.3.According to the weakness of MISTY1's FL layer and key extension algorithm, In this paper, two interesting properties of MISTY1 algorithm are proposed, and the middle encounter collision is constructed, and the full round MISTY1 attack against the single secret key is realized for the first time. The amount of data required is as low as one selected plaintext.
【学位授予单位】：解放军信息工程大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TN918.1

【参考文献】