2008 Volume 17 Issue 5
Article Contents

Zheng Fan, Tian Xiao-Jian, Li Xue-Yan, Wu Bin. 2008: Hash function based on the generalized Henon map, Chinese Physics B, 17(5): 1685-1690.
Citation: Zheng Fan, Tian Xiao-Jian, Li Xue-Yan, Wu Bin. 2008: Hash function based on the generalized Henon map, Chinese Physics B, 17(5): 1685-1690.

Hash function based on the generalized Henon map

  • Available Online: 30/05/2008
  • Fund Project: the National Natural Science Foundation of China (Grant 60372061)
  • 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.
  • 加载中
  • 加载中
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Article Metrics

Article views(70) PDF downloads(0) Cited by(0)

Access History

Hash function based on the generalized Henon map

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.

Reference (0)

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return