Distribution Characteristics of the AES-128 Biclique Structure
Funds:
The National 863 Program of China (2011AA 7011016)
-
摘要: Biclique攻擊是目前唯一能將對(duì)AES全輪攻擊降至窮舉攻擊之下的密鑰恢復(fù)攻擊，但如何得到AES新的Biclique結(jié)構(gòu)或全部Biclique結(jié)構(gòu)尚沒有解決。該文設(shè)計(jì)了尋找AES-128全部Biclique結(jié)構(gòu)的算法以及衡量基于相應(yīng)結(jié)構(gòu)Biclique攻擊的數(shù)據(jù)和時(shí)間復(fù)雜度的算法，得出了AES-128共有215類i-差分能產(chǎn)生555個(gè)Biclique結(jié)構(gòu)，給出了數(shù)據(jù)復(fù)雜度最小和次小的i-差分路徑，分別列出了計(jì)算復(fù)雜度最小和數(shù)據(jù)復(fù)雜度最小的Biclique差分及匹配。
-
關(guān)鍵詞:
- 分組密碼 /
- AES-128 /
- Biclique攻擊 /
- Biclique結(jié)構(gòu)
Abstract: The current Biclique attack is the only key recovery method for the full AES faster than brute-force, but how to get a new Biclique structure or all Biclique structures for AES has not been resolved. This paper designs algorithms to find all Biclique structures for AES-128 and evaluate the computational complexity or data complexity of corresponding Biclique attacks. Using these algorithms, this paper gives that there are 215 kindsi-differentials to generate 555 Biclique structures of AES-128, presentsi-differential trails with the smallest and the second smallest data complexity, and gets Biclique differentials and matching with the smallest computational complexity and the smallest data complexity respectively.-
Key words:
- Block ciphers /
- AES-128 /
- Biclique attack /
- Biclique structure
-
DAEMEN J and RIJMEN V. The design of Rijndael: AES- the advanced encryption standard[S]. Springer-Verlag, 2002. NIELS F, JOHN K, STEFAN L, et al. Improved cryptanalysis of Rijndael[J]. LNCS, 2000, 1978: 213-230. HENRI G and MARINE M. A collision attack on 7 rounds of Rijndael[C]. Third AES Candidate Conference, New York, USA, 2000: 230-241. HAMID M, MOHAMMAD D, RIJMEN V, et al. Improved impossible differential cryptanalysis of 7-round AES-128[J]. LNCS, 2010, 6498: 282291. DUNKELMAN O, KELLER N, and SHAMIR A. Improved single-key attacks on 8-round AES-192 and AES-256[J]. LNCS, 2010, 6477: 158-176. DMITRY K, CHRISTIAN R, and ALEXANDRA S. Bicliques for preimages: attacks on Skein-512 and the SHA-2 family[C]. 19th International Workshop on Fast Software Encryption, Washington DC, USA, 2012: 244-263. WANG Yanfeng, WU Wenling, and YU Xiaoli. Biclique cryptanalysis of reduced-round piccolo block cipher[J]. LNCS, 2012, 7232: 337-352. ANDREY B, DMITRY K, and CHRISTIAN R. Biclique cryptanalysis of the full AES[C]. ASIACRYPT11, Seoul, Korea, 2011: 344-371. 徐田敏. 分組密碼AES和ARIA算法的Biclique分析[D]. [碩士論文], 信息工程大學(xué), 2013. XU Tianmin. Biclique cryptanalysis of AES and ARIA block cipher[D]. [Master dissertation]. Information Engineering University, 2013. 謝作敏, 陳少真, 魯林真. 11輪3D密碼的不可能差分攻擊[J]. 電子與信息學(xué)報(bào), 2014, 36(5): 1215-1220. doi: 10.3724/SP.J. 1146.2013.00948. XIE Zuomin, CHEN Shaozhen, and LU Linzhen. Impossible differential cryptanalysis of 11-round 3D cipher[J]. Journal of Electronics Information Technology, 2014, 36(5): 1215-1220. doi: 10.3724/SP.J.1146.2013.00948. 羅偉, 郭建勝. Eagle-128算法的相關(guān)密鑰-矩形攻擊[J]. 電子與信息學(xué)報(bào), 2014, 36(6): 1520-1524. doi: 10.3724/SP.J. 1146.2013.01239. LUO Wei and GUO Jiansheng. Related-key rectangle attack on Eagle-128 algorithm[J]. Journal of Electronics Information Technology, 2014, 36(6): 1520-1524. doi: 10.3724 /SP.J.1146.2013.01239. 沈璇, 李瑞林, 李超, 等. SHACAL-2算法中非線性函數(shù)的差分特性及其應(yīng)用[J]. 電子與信息學(xué)報(bào), 2014, 36(7): 1661-1666. doi: 10.3724/SP.J. 1146.2013.01717. SHEN Xuan, LI Ruilin, LI Chao, et al. Differential analysis of the nonlinear functions of SHACAL-2 algorithm and the application[J]. Journal of Electronics Information Technology, 2014, 36(7): 1661-1666. doi: 10.3724/SP.J.1146. 2013.01717. 郭瑞, 金晨輝. 低輪FOX64算法的零相關(guān)-積分分析[J]. 電子與信息學(xué)報(bào), 2015, 37(2): 417-422. doi: 10.11999/ JEIT140373. GUO Rui and JIN Chenhui. Integral cryptanalysis of reduced round FOX64[J]. Journal of Electronics Information Technology, 2015, 37(2): 417-422. doi: 10.11999/ JEIT140373. -
計(jì)量
- 文章訪問數(shù): 1297
- HTML全文瀏覽量: 119
- PDF下載量: 951
- 被引次數(shù): 0
下載:
