A novel keyed parallel hashing scheme based on a new chaotic system

• A novel fast and secure chaotic system and random number generator based on one dimension chaotic maps is proposed.
• A new parallel chaotic hashing scheme using new chaotic system and dynamic array of functions with high performance and security is represented.
• Security and performance flaws of previous related works has been improved using new hashing scheme.
• Parameterizing of hash function over its speed and performance is obtained.

Hash functions play important role in the information security era. Although there are different methods to design these functions, in recent years chaos theory has emerged as a strong solution in this area. Chaotic hash functions use one-dimensional maps such as logistic and tent, or employ complex multi-dimensional maps which are typically insecure or slow and most of them has been successfully attacked. In this paper, we propose a new chaotic system and employ it to design a secure and fast hash function. The improved security factor has roots in the hyper sensitivity of the proposed chaotic map while properties like speed and security can be parameterized. On the other hand, the proposed hash function has a dynamic random array of functions and can be implemented by a parallel architecture. This data-level parallel architecture makes it fast to generate the hash value. Statistical simulations show success of the proposed hashing scheme. Cryptanalysis of proposed function, such as key sensitivity, meet-in-the-middle attack, collision, preimage resistance and high level attacks, proves security of the proposed function.