摘要
Rijndael算法的高效实现是人们研究的焦点。文中从Rijndael算法的加密过程分析入手,提出采用基于查表的快速加密方法。其主要方法是利用预先构造S 盒表格和列混合运算的序列表格,加密时通过两次查表和12次简单的循环移位操作和一些模加运算即可实现加密过程,从而有效的提高了Rijndael算法的实现效率。同时分析了Rijndael算法比DES的优越性能。
The efficient realization of Rijndael algorithm is always a hotpot in research. This paper at first analyzes encryption process of Rijndael, and then it puts forward speedy encryption means based on check-table. The chief method is constructing s-table and mixcolumn-list. By checking table or list twice and 12 times simple circle shift and sum modulo 2, the encrypting of the plaintext can be realized. Thereby the realization efficiency of Rijndael algorithm is improved. At the same time this paper analyzes the excellent performances of Rijndael algorithm in contrast to DES.
出处
《计算机应用》
CSCD
北大核心
2004年第2期12-14,共3页
journal of Computer Applications
基金
重庆市科技攻关计划资助项目(7220 B 21)
重庆邮电学院青年教师科技基金资助项目(A2002 19)
重庆市教委资助项目
