A fast and efficient chaos-based keyed hash function

作者:Kanso A*; Ghebleh M
来源:Communications in Nonlinear Science & Numerical Simulation, 2013, 18(1): 109-123.
DOI:10.1016/j.cnsns.2012.06.019

摘要

This paper proposes a new chaotic keyed hash function based on a single 4-dimensional chaotic cat map whose irregular outputs are used to compute a hash value. The suggested scheme is fast, efficient and flexible. It takes an input message of arbitrary length and returns a hash value of a fixed length n, where n is a multiple of 32 (by convention, n is usually one of the numbers 128, 160, 256, 512, and 1024). Simulation results are presented to demonstrate the suggested hashing scheme's high sensitivity to the original message and the secret key, as well as its strong capability for confusion and diffusion, and very strong collision resistance. In comparison with existing work, especially those based on chaotic maps, the proposed scheme exhibits superior performance.

  • 出版日期2013-1