欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
本文在基于非线性多变元多项式方程组难解性的基础上,提出了一种新的Hash算法,新算法与目前广泛使用的Hash算法相比具有下列优点：安全性基于一个公认的数学难题;输出Hash值长度可变;引入了整体随机性,从一族Hash函数中随机选择Hash函数而不是随机化消息本身;设计自动化,用户可根据实际需求构造满足其特定要求的Hash函数.本文还详细讨论了新Hash算法的安全性、效率和性能,并通过仿真实验,指出了新算法的具体构造方法.实验结果表明,新算法在效率和性能方面与其它Hash函数具有可比性.
英文摘要：
The novel Hash algorithm whose security is based on the difficult of multivariate polynomial equations over a finite field is designed and implemented.We propose the idea of building a secure hash using higher degree multivariate polynomials as the compression function of MPH.The new algorithm compared with the current widespread use of the Hash algorithms has the following advantages：Security based on a recognized difficult problem of mathematics;Hash length can be free to change,according to the needs of the user;Hash function as a whole is Randomly selected;Design automation,users can be constructed to meet the actual needs of the specific Hash function.We analyze some security properties and potential feasibility,where the compression functions are randomly chosen 3rd polynomials,the experiment results show that the new algorithm has good properties in the efficiency and performance,and is comparable with other Hash functions.
同期刊论文项目
同项目期刊论文
Koblitz Elliptic Curves Generating Based on Evolutionary Cryptography Theory and Verifying Parameter
Hybrid Strategy of Particle Swarm Optimization and Simulated Annealing for Optimizing Orthomorphisms
期刊信息
位置：