摘要
本文对Rijndael-256密码进行分析,从比特的层面上寻找平衡性,得到了一个新的3轮积分区分器,该区分器仅需32个明文就可将3轮Rijndael-256与随机置换区分开来,并且所得密文的每一比特都是平衡的.该区分器在已知的Rijndael-256积分区分器中所需明文量最少.基于新的区分器,对4至7轮Rijndael-256密码进行了攻击.文章还从字节的角度重新刻画了基于比特的积分思想,这一方法可用于分析其他基于字节设计的SPN型分组密码.
Rijndael-256 is analyzed in this paper.We trace the propagation of the plaintexts structure at bit-level to obtain the property,and present a new 3-round distinguisher which needs least chosen plaintexts of all the known integral distinguishers.In this distinguisher,32 chosen plaintexts are encrypted by 3-round cipher,each bit of the cipertext is balanced.Based on the new distinguisher,reduced-round Rijndael-256 are attacked.The paper also analyzes the distinguisher from another point of view,which can also be applied to other byte-oriented ciphers with SPN structure.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2011年第2期476-480,共5页
Acta Electronica Sinica
基金
国家自然科学基金(No.60803156
61070215)
信息安全国家重点实验室开放基金(No.01-07)