本文關(guān)鍵詞： 分組密碼 ARIA算法 3D算法 MISTY1算法 不可能差分攻擊 中間相遇攻擊 單密鑰 預(yù)計算技術(shù)　出處：《解放軍信息工程大學》2014年碩士論文　論文類型：學位論文

【摘要】：分組密碼較其它密碼算法,具有加解密速度快、易于標準化以及便于在各種軟硬件平臺實現(xiàn)等優(yōu)勢,這使得其廣泛用于數(shù)據(jù)流加解密、身份認證、密鑰分配管理等領(lǐng)域并擔任著核心加解密算法的角色,在通信與信息安全領(lǐng)域有及其重要的戰(zhàn)略地位.因此,對于分組密碼的安全性分析一直是密碼學乃至整個信息研究領(lǐng)域的研究熱點.本文首先對ARIA算法和3D算法進行了不可能差分分析;其次,給出了低數(shù)據(jù)復(fù)雜度的全輪MISTY1算法的中間相遇攻擊.具體研究成果如下:1.根據(jù)ARIA算法的結(jié)構(gòu)特點,充分利用擴散層的相關(guān)性質(zhì),構(gòu)造出擴散層的一個新的等價關(guān)系,并結(jié)合“early abort”技術(shù)、預(yù)計算技術(shù)和Hash表存儲技術(shù),實現(xiàn)了ARIA-192算法的7輪不可能差分攻擊,并將ARIA-256攻擊的時間復(fù)雜度降低為192.22.2.構(gòu)造出3D算法一類新的6輪不可能差分區(qū)分器,最大程度利用Hash存儲的預(yù)計算技術(shù),首次將3D密碼的不可能差分攻擊擴展到11輪.同時將10輪不可能差分攻擊時間復(fù)雜度降為318.82.3.根據(jù)MISTY1的FL層以及密鑰擴展算法弱點,提出了MISTY1算法2個有趣的性質(zhì),并由此構(gòu)造出中間相遇碰撞,并首次實現(xiàn)對于單密鑰的全輪MISTY1攻擊,需要的數(shù)據(jù)量低至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

【參考文獻】

相關(guān)期刊論文 前5條

1 蘇崇茂;韋永壯;馬春波;;10輪3D分組密碼算法的中間相遇攻擊[J];電子與信息學報;2012年03期

2 蘇崇茂;;7輪ARIA-256的不可能差分新攻擊[J];計算機應(yīng)用;2012年01期

3 唐學海;李超;王美一;屈龍江;;3D密碼的不可能差分攻擊[J];電子與信息學報;2010年10期

4 王美一;唐學海;李超;屈龍江;;3D密碼的Square攻擊[J];電子與信息學報;2010年01期

5 吳文玲;張文濤;馮登國;;Impossible Differential Cryptanalysis of Reduced-Round ARIA and Camellia[J];Journal of Computer Science & Technology;2007年03期

，

本文編號：1539936