A chaos-based hash function with both modification detection and localization capabilities

Recently, a variety of chaos-based hash functions have been proposed. Nevertheless, none of them can realize modification localization. In this paper, a hash function with both modification detection and localization capabilities is proposed, which can also support the parallel processing mode. By using the mechanism of changeable-parameter and self-synchronization, the keystream can establish a close relation with the algorithm key, the content, and the order of each message unit. Theoretical analysis and computer simulation indicate that the proposed algorithm can satisfy the performance requirements of hash functions.