Hash function based on the generalized Henon map

A new Hash function based on the generalized Henon map is proposed.We have obtained a binary sequence with excellent pseudo-randomcharacteristics through improving the sequence generated by thegeneralized Henon map, and use it to construct Hash function. Firstwe divide the message into groups, and then carry out the Xoroperation between the ASCII value of each group and the binarysequence, the result can be used as the initial values of the nextloop. Repeat the procedure until all the groups have been processed,and the final binary sequence is the Hash value. In the scheme, theinitial values of the generalized Henon map are used as the secretkey and the messages are mapped to Hash values with a designatedlength. Simulation results show that the proposed scheme has strongdiffusion and confusion capability, good collision resistance, largekey space, extreme sensitivity to message and secret key，and it iseasy to be realized and extended.