A Fast New Cryptographic Hash Function Based on Integer Tent Mapping System

Abstract

This paper proposes a novel one-way Hash function which is based on the Coupled Integer Tent Mapping System and termed as THA (THA-160, THA-256). The THA-160 compresses a message of arbitrary length into a fingerprint of 160 bits, well the THA-256 compresses a message of arbitrary length into a fingerprint of 256 bits. The algorithm adopts a piecewise message expansion scheme. Compared with SHA-1 and SHA-256 message expansion, the message expansion scheme has enhanced the degree of nonlinear diffusion of the message expansion, and thus increased the computation efficiency. In addition, as the major nonlinear component of compression function, the traditional logic functions are replaced by the integer tent map, and so the scheme has ideal properties of diffusion and confusion. Furthermore, the parallel iteration structure is adopted in the compression functions, which is advantageous to high speed parallel operation of software and hardware. Preliminary security testing indicates that, this Hash function has a high degree of security, and it can be realized easily with great rapidity. Therefore, it is an ideal substitution for conventional Hash function.

Design and security analysis of two robust keyed hash functions based on chaotic neural networks

“…Also, a neural network is characterized by its confusion-diffusion and compression properties that are required to design secure hash functions. However, many researchers developed hashing schemes based on simple chaotic maps, such as logistic map, high-dimensional discrete map, piecewise linear chaotic map, tent map, and Lorenz map or on 2D coupled map lattices [5][6][7][8][9][10][11][12][13][14][15][16][17][18]. In 2007, Zhang et al, [19] proposed a novel chaotic keyed hash algorithm using a feed forward-feedback nonlinear filter.…”

A New Hash Function Based on Chaotic Maps and Deterministic Finite State Automata

“…These characteristics include sensitivity to small changes to initial conditions and system parameters, random-like behavior, ergodicity, diffusion and confusion properties. Thus, various hash function constructs have been proposed based on the chaotic systems such as iterating simple chaotic maps [21], [22], multiple maps [23], high-dimensional maps [24], [25] and message block-controlled hyperchaotic map [26]. Other chaos-based hash functions in literature include Li et al's hash function based on generalized chaotic maps with perturbed chaotic parameters [27], Ahmad et al design based on the dynamics of a nonlinear 12-term 4D chaotic system [28], Liu et al's proposal based on the Lorenz system with multiple parame-ters and time-varying perturbation [29].…”

Parallel chaotic hash function based on the shuffle-exchange network

“…Recently proposed algorithms range from the use of simple maps such as the tent map [4,9,12] and logistic map [13,26] to more complex maps such as the sine map [6], standard map [31] and piecewise linear/nonlinear chaotic maps [1,10,27,28]. High-dimensional chaotic maps have also been used in hash functions for higher complexity and better mixing [2,7,15].…”