| SHA-3杂凑密码候选算法简评 |
| |
| 作者姓名： | 薛宇 吴文玲 王张宜 |
| |
| 作者单位： | 中国科学院软件研究所信息安全国家重点实验室,北京 100190; 中国科学院研究生院信息安全国家重点实验室,北京 100049 |
| |
| 基金项目： | 国家自然科学基金项目(60873259)和863项目(2007AA01Z470)资助 |
| |
| 摘 要： | 为制订新的密码Hash算法标准SHA-3,NIST面向全世界发起了征集活动,目前对51个第一轮候选算法的分析评估工作已经在世界范围内火热展开.这些算法是Hash函数领域最新设计思想的集体展示,也会和AES一样成为密码学发展的一个里程碑.为了让更多的中国读者了解这些新的Hash算法并参与评估,简要介绍了目前安全的候选算法,并对51个候选算法的结构进行分类,对安全性和性能设计进行归纳总结和概要评估.
|
| 关 键 词： | Hash函数 碰撞 有效实现 结构 差分 |
| 收稿时间： | 2009-04-08 |
| 修稿时间： | 2009-05-13 |
Survey on the candidate algorithms of SHA-3 Hash function family |
| |
| Authors: | XUE Yu WU Wen-Ling WANG Zhang-Yi |
| |
| Institution: | State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing 100190,China; State Key Laboratory of Information Security, Graduate University, Chinese Academy of Sciences, Beijing 100049, China |
| |
| Abstract: | In order to develop the new Secure Hash Standard(SHA-3), NIST has announced request for candidate algorithms. Now the 51 first-round candidates are under evaluation worldwide. These algorithms represent the newest design ideas of cryptographic hash function, and SHA-3 will be another milestone like AES. In order to make domestic researchers know these new algorithms and join the work of evaluation, we briefly introduce these secure algorithms and classify them according to the structure. Meanwhile we sum up the design of security and efficiency on these algorithms. |
| |
| Keywords: | Hash function collision efficient implementation structure differential |
|
| 点击此处可从《》浏览原始摘要信息 |
| 点击此处可从《》下载免费的PDF全文 |
|
