计算机工程2012，Vol.38Issue(7)：107-109,3.DOI:10.3969/j.issn.1000-3428.2012.07.035
Rijndael-256算法的中间相遇攻击
Meet-in-the-Middle Attack on Rijndael-256 Algorithm
摘要
Abstract
A 5-round meet-in-the-middle distinguisher is constructed by exploiting the properties of Rijndael-256 cipher. It shows that, if only the first byte is variable in the input data state, then each byte differential value of the output of fifth round Rijndael-256 encryption is completely determined by the first byte value in the input data state and 25 constant bytes with a probability of 2'%. Based on the distinguisher, a meet-in-the-middle attack on 9-round Rijndael-256 is proposed. Analysis reslut shows that the attack requires data complexity of about 2128 chosen plaintexts and time complexity of about 22116 9-round Rijndael-256 encryptions.关键词
分组密码/Rijndael算法/区分器/中间相遇攻击Key words
block cipher/ Rijndael algorithm/ distinguisher/ meet-in-the-middle attack分类
信息技术与安全科学引用本文复制引用
韦永壮,苏崇茂,马春波..Rijndael-256算法的中间相遇攻击[J].计算机工程,2012,38(7):107-109,3.基金项目
国家自然科学基金资助项目(60862001,61100185) （60862001,61100185）
广西自然科学基金(青年基金)资助项目(2011GXN SFB018071) （青年基金）
桂林电子科技大学广西无线宽带通信与信号处理重点实验室主任基金资助项目(11101) （11101）
