ABSTRACT
This chapter provides an algorithm for both modification detection and localization, whose structure can support parallel processing mode and describes the hash function algorithm. A cryptographic hash function is used to compress the message data to a fixed-size hash value in such a way that any alternation to the data will generate a different hash value. The uniform distribution of hash value is one of the most important requirements of hash functions related to security. Two-dimensional graphs are used to demonstrate the differences between the original message and the final detection hash value. The inherent merits of chaos, such as the sensitivity to tiny changes in initial conditions and parameters, mixing property, ergodicity, unstable periodic orbits with long periods, and one-way iteration, form the potential foundation for excellent hash function construction. Chaos is a kind of deterministic random-like process provided by nonlinear dynamic systems.
