Design and Analysis of Multivariate Hash Function

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.