One-Way Hash Function based on Integer Coupled Tent Maps and Its Performance Analysis

A one-way hashing algorithm is a deterministic algorithm that compresses an arbitrary long message into a value of specified length. The output value represents the fingerprint or digest of the message. In this paper, A novel integer coupled tent maps-based cryptographic one-way hash function is put forward and an analysis on its characteristics is carried out. In the algorithm, the two-way coupled map lattice model is adopted, and the traditional logic functions are replaced with the integer tent map, so that it has ideal diffusion and confusion properties. The Hash value of 160 bits is obtained from a message with arbitrary length by means of the nonlinear transform on the coupled iteration integer sequences. Aanalysis and simulation results indicate that the algorithm has good one-way and collision resistant performances,which satisfy all kinds of functional requirements of one-way Hash. The Hash function all adopts simple integer operation, so that it could be easily realized both in software and hardwareand high implementation efficiency could be realized. The integer coupled tent maps-based Hash function serves as one of the most highly competitive candidates for practical applications of Hash function and secure information communications in computer networks.