Designing Chaotic Chirikov Map-Based Secure Hash Function

In this paper, a new algorithm for designing one-way cryptographic hash function using chaotic Chirikov map is proposed. High sensitivity of Chirikov system makes it an ideal candidate for secure hash function design. In the proposed algorithm, the input message is split into a number of small blocks. The blocks are processed using chaotic map. The two intermediate hashes are generated using evolved control and input parameters. The two intermediate hash values are then employed to yield the final variable-length hash. The simulation and statistical analyses illustrate that the anticipated hash algorithm exhibits encouraging lineaments like high sensitivity to input messages and key, satisfactory confusion and diffusion attributes which verify the suitableness of proposed algorithm for the design of secure cryptographic variable-length hash functions.