Rijndael算法代数性质及其七轮攻击  

Some Algebraic Properties and 7-round Attack of the Rijndael

作　　者：王新房[1] 马安光[1] 

机构地区：[1]西安理工大学计算机科学与工程学院,西安710048

出　　处：《计算机工程与应用》2005年第21期86-88,共3页Computer Engineering and Applications

摘　　要：2000年被选为AES的Rijndael算法是SPN(SubstitutionPermutationNetwork)结构的分组密码。由于此算法依托于代数学理论的加密算法,所以本文介绍了它的基本函数的一些代数性质并提出了轮变换的一些差分特征。然后根据其中的一些代数性质和差分特征对Rijndael-128-192算法进行了七轮攻击,使得这种攻击方法比穷尽攻击更有效。Rijndael algorithm is an SPN(Substitution Permutation Network) structure block cipher,which has been selected as AES in 2000.For Rijndael algorithm is based on the algebraic theory,we introduce some algebraic properties of the basic function used in the Rijndael and present some differential characteristics of the Round transformation.In according to some algebraic properties and differential characteristics,we attack the 7-round of the Rijndael-128-192.we can observe that this method is better than the exhaustive search.

关 键 词：RIJNDAEL算法 差分特征 攻击 代数性质 

分 类 号：TP309.2[自动化与计算机技术—计算机系统结构]