| Summary: | In this paper, a new chaos-based hash function is proposed based on a recently proposed structure known as the deterministic chaotic finite state automata (DCFSA). Out of its various configurations, we select the forward and parameter permutation variant, $DCFSA_{FWP}$ due to its desirable chaotic properties. These properties are analogous to hash function requirements such as diffusion, confusion and collision resistance. The proposed hash function consists of six machine states and three simple chaotic maps. This particular structure of DCFSA can process larger message blocks (leading to higher hashing rates) and optimizes its randomness. The proposed hash function is analyzed in terms of various security aspects and compared with other recently proposed chaos-based hash functions to demonstrate its efficiency and reliability. Results indicate that the proposed hash function has desirable statistical characteristics, elevated randomness, optimal diffusion and confusion properties as well as flexibility.
|
|---|