摘要
分组密码迭代圈数与算法的安全性及运算速度直接相关。传统的一些分组密码设计采用的是基于经验的提高圈函数迭代上界的方案,可证安全性是设计完成之后的一系列说明。文中从设计角度出发,提出最少迭代圈数需要结合算法与随机预言优势的偏差确定。笔者对分组密码算法圈数进行量化研究,说明理想随机预言机与圈函数、圈数之间的相互制约关系。
The round number is directly related to both the security and speed of block cipher algorithm. The traditional design methods of block cipher, based on the experience, adopt increasing the most economic round number. And the provable security of the algorithm was demonstrated afterwards. This paper advocates that the economic boundary should be operated before the algorithm design. The proposed approach is that both the round function and randomness oracle should be considered in the calculation of the round number.
出处
《通信技术》
2007年第6期44-45,51,共3页
Communications Technology
基金
国家自然科学基金资助项目(60673075)
863基金项目(2006AA01Z428)资助
关键词
分组密码算法圈函数
圈数
可证安全
block cipher’s round function
round number
provable secure
