Collision analysis of a chaos-based hash function with both modification detection and localization capability

The collision problem of a chaos-based hash function with both modification detection and localization capability is investigated [Xiao D, Shih FY, Liao XF. A chaos-based hash function with both modification detection and localization capabilities. Commun Nonlinear Sci Numer Simulat 2010;15(9):2254–61]. The simulation gives the same detection and localization hash values for distinct messages. The expense of the birthday attack on the hash function is far less than expected. The certain symmetries of message distribution may result in the same detection hash value for distinct messages.

► Simulations show that collisions exist in the hash algorithm. ► The cost of birthday attack on the algorithm is less than the expected of 264. ► The certain symmetries of messages induce the unchanged detection hash value.