摘要
该文对Rijndael分组密码进行了较为深入的研究,将字节代替变换中的有限域GF(28)上模乘求逆运算和仿射变换归并成了一个8×8的S盒,将圈中以字节为单位进行的行移位、列混合、密钥加三种运算归并成了一个广义仿射变换,归并结果表明Rijndael密码实质上是一个形如仿射变换的非线性迭代算法。基于分析给出了Rijndael密码算法的精简描述,并指出了算法预计算快速实现的有效方法。
In this pap er,Rijndael block cipher is studied in a deep way,the modular multiply inverse element computing and affine transformation of Galois field GF(2 8 )in Bytesub transformation is merged into a S-box of8×8,the ShiftRow, MixColumn and AddRoundKey computing measured by bytes of every round is merged into a general affine transformation.The result of merging indicates that Rijnd ael cipher is a nonlinear recurrence algorithm seemed as if an affine transforma tion.Based on analysis,this paper concisely describes Rijndael cipher algorith m,and points out an effective way of fast realization of this algorithm by pre -computation.
出处
《计算机工程与应用》
CSCD
北大核心
2002年第13期113-115,共3页
Computer Engineering and Applications
基金
浙江省自然科学基金重点资助项目(编号:ZD0101)