中国物理B ›› 2008, Vol. 17 ›› Issue (5): 1685-1690.doi: 10.1088/1674-1056/17/5/025

• GENERAL • 上一篇    下一篇

Hash function based on the generalized Henon map

郑 凡, 田小建, 李雪妍, 吴 斌   

  1. College of Electronic Science and Engineering, Jilin University, Changchun 130012, China
  • 收稿日期:2007-10-09 修回日期:2007-12-19 出版日期:2008-05-20 发布日期:2008-05-20
  • 基金资助:
    Project supported by the National Natural Science Foundation of China (Grant No 60372061).

Hash function based on the generalized Henon map

Zheng Fan(郑凡), Tian Xiao-Jian(田小建)†, Li Xue-Yan(李雪妍), and Wu Bin(吴斌)   

  1. College of Electronic Science and Engineering, Jilin University, Changchun 130012, China
  • Received:2007-10-09 Revised:2007-12-19 Online:2008-05-20 Published:2008-05-20
  • Supported by:
    Project supported by the National Natural Science Foundation of China (Grant No 60372061).

PDF (PC)

556

赞

摘要： A new Hash function based on the generalized Henon map is proposed. We have obtained a binary sequence with excellent pseudo-random characteristics through improving the sequence generated by the generalized Henon map, and use it to construct Hash function. First we divide the message into groups, and then carry out the Xor operation between the ASCII value of each group and the binary sequence, the result can be used as the initial values of the next loop. Repeat the procedure until all the groups have been processed, and the final binary sequence is the Hash value. In the scheme, the initial values of the generalized Henon map are used as the secret key and the messages are mapped to Hash values with a designated length. Simulation results show that the proposed scheme has strong diffusion and confusion capability, good collision resistance, large key space, extreme sensitivity to message and secret key，and it is easy to be realized and extended.

Abstract: A new Hash function based on the generalized Henon map is proposed. We have obtained a binary sequence with excellent pseudo-random characteristics through improving the sequence generated by the generalized Henon map, and use it to construct Hash function. First we divide the message into groups, and then carry out the Xor operation between the ASCII value of each group and the binary sequence, the result can be used as the initial values of the next loop. Repeat the procedure until all the groups have been processed, and the final binary sequence is the Hash value. In the scheme, the initial values of the generalized Henon map are used as the secret key and the messages are mapped to Hash values with a designated length. Simulation results show that the proposed scheme has strong diffusion and confusion capability, good collision resistance, large key space, extreme sensitivity to message and secret key，and it is easy to be realized and extended.

Key words: the generalized Henon map, Hash function, chaos

中图分类号:  (Nonlinear dynamics and chaos)

  • 05.45.-a
02.30.Uu (Integral transforms)