A Simple Secure Hash Function Scheme Using Multiple Chaotic Maps

• Published in: 3D research Vol. 8; no. 2; pp. 1 - 15
• Main Authors: Ahmad, Musheer, Khurana, Shruti, Singh, Sushmita, AlSharari, Hamed D.
• Format: Journal Article
• Language: English
• Published: Seoul 3D Display Research Center 01.06.2017; Springer Nature B.V
• Subjects: 3DR Express; Chaos theory; Computer Imaging; Computer simulation; Cryptography; Engineering; Hash based algorithms; Lasers; Optical Devices; Optics; Parameter sensitivity; Pattern Recognition and Graphics; Photonics; Signal,Image and Speech Processing; Vision; Hash function; Security; Multiple chaotic maps; Confusion and diffusion
• ISSN: 2092-6731; 2092-6731
• DOI: 10.1007/s13319-017-0123-1

The chaotic maps posses high parameter sensitivity, random-like behavior and one-way computations, which favor the construction of cryptographic hash functions. In this paper, we propose to present a novel hash function scheme which uses multiple chaotic maps to generate efficient variable-sized hash functions. The message is divided into four parts, each part is processed by a different 1D chaotic map unit yielding intermediate hash code. The four codes are concatenated to two blocks, then each block is processed through 2D chaotic map unit separately. The final hash value is generated by combining the two partial hash codes. The simulation analyses such as distribution of hashes, statistical properties of confusion and diffusion, message and key sensitivity, collision resistance and flexibility are performed. The results reveal that the proposed anticipated hash scheme is simple, efficient and holds comparable capabilities when compared with some recent chaos-based hash algorithms.