Abstract
Hash functions are considered as the core of cryptography, which are the basic technique used for data security. Cryptographic hash functions also can be used to achieve the integrity of large data such as the data stored in a hard disk and set of financial data. So, in the era of large data and increasing capacity of data in applications, fast hash schemes with parallel operations are extremely desirable which effectively increases the computational speed. Functions of random behavior like chaotic maps are used in hash functions to generate the fixed length message digest from the original message. This paper proposes a parallel hash algorithm based on multiple chaotic functions by mixing logistic map, tent map, and sine function. In the proposed scheme the structure of coupling lattice is changed and using diamond lattice as new structure. This algorithm is flexible to generate 128, 256 or longer hash value. The simulation analysis such as hash distribution, key sensitivity, confusion and diffusion statistical properties, and collision resistance are executed. The results demonstrated that the proposed hash is an efficient, simple and fast algorithm comparing with some recent hash algorithms based on chaotic maps.
Highlights
A hash function must be a one-way function that means the hash can convert any length of message to fixed length
The hash function must have the following qualities in order to be an efficient cryptographic algorithm: 1) Pre-image resistance: this indicates that it is difficult to reverse the hash function computationally. To put it another way, for any hash function H that outputs hash value D, it must be a difficult procedure to discover an input value X that hashes to D. This feature makes the algorithm more robust against the attacker that has only the hash value and trying to find the input. 2)Second pre-image resistance: This indicates that given input and its associated hash, getting -another input with the same hash would be impossible
A keyed hash function hk must possess some properties; a) for any given hk and input x, it is easy to generate the output y. b) when y is given without knowing the key k, it is hard to find x. c) when x is given without knowing k, it is hard to find y [3]
Summary
A hash function must be a one-way function that means the hash can convert any length of message to fixed length. The hash function must have the following qualities in order to be an efficient cryptographic algorithm: 1) Pre-image resistance (one-way feature): this indicates that it is difficult to reverse the hash function computationally. For a given input H(X) that is the hash value of an input X, it should be difficult to identify any other input value Y such that H(Y) = H(X) This feature keeps the algorithm safe against the attacker who possesses the input and its hash digest and aims to find another input that can be replaced instead of the original input. Message Authenticity and Integrity: Verifying the authenticity and integrity of data is the major necessity in network and computer systems These properties are the most important application of the hash functions. III illustrates the proposed hash function, Sect IV investigated the theoretical analysis and computer simulation results, Sect V showed comparative analysis with some recent chaosbased hashes, Sect.VI presented the conclusion
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
