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

@article{Liu2012AFN,
  title={A Fast New Cryptographic Hash Function Based on Integer Tent Mapping System},
  author={Jiandong Liu and Xiahui Wang and Kai Yang and Chen Zhao},
  journal={J. Comput.},
  year={2012},
  volume={7},
  pages={1671-1680}
}
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… 
Parallel chaotic hash function based on the shuffle-exchange network
TLDR
Results show that the proposed design has strong security strength with near-perfect statistical qualities and fast hashing speed that surpasses both chaotic hash functions and the MD5 hash function.
A fast and efficient hash function based on generalized chaotic mapping with variable parameters
TLDR
The results illustrate that the suggested algorithm is fast, efficient, and enough simple and has good confusion and diffusion capabilities, strong collision resistance, and a high level of security.
A Novel Hash Function Based on a Chaotic Sponge and DNA Sequence
TLDR
The proposed hash function can also extend the provably secure notions of the sponge construction, specifically the indifferentiability from random oracles, and has a high level of performance as compared to other chaos-based hash functions.
Chaotic hash function based on the dynamic S-Box with variable parameters
TLDR
The results demonstrate that the proposed algorithm has good statistical properties, strong collision resistances and better performance compared with other schemes.
A New Hash Function Based on Chaotic Maps and Deterministic Finite State Automata
TLDR
Results indicate that the proposed hash function has desirable statistical characteristics, elevated randomness, optimal diffusion and confusion properties as well as flexibility.
Design and security analysis of two robust keyed hash functions based on chaotic neural networks
TLDR
The obtained results of several statistical tests and cryptanalytic analysis highlight the robustness of the proposed keyed CNN hash functions, which is fundamentally due to the strong non-linearity of both the chaotic systems and the neural networks.
Differential Fault Analysis on the MD5 Compression Function
TLDR
This paper proposes a new differential fault analysis on the MD5 compression function in the word-oriented random fault model and provides a new reference for the security analysis of the same structure of the hash compression functions.
Design, implementation and analysis of keyed hash functions based on chaotic maps and neural networks
Les fonctions de hachage sont des primitives les plus utiles en cryptographie. En effet, elles jouent un role important dans l’integrite des donnees, l’authentification des messages, la signature
Cryptographic and parallel hash function based on cross coupled map lattices suitable for multimedia communication security
TLDR
This paper presents a cryptographic and parallel chaotic hash function based on the cross coupled map lattices for multimedia communication security, and demonstrates that the proposed hash algorithm has statistical properties with B̄=64.0022$ and P = 50.0017%, collision resistance with d =‬85.3944, average computation speed of 132.0 Mbps, and better statistical performance compared with existing chaotic hash functions.

References

SHOWING 1-10 OF 32 REFERENCES
HAVAL - A One-Way Hashing Algorithm with Variable Length of Output
TLDR
This paper proposes a one-way hashing algorithm called HAVAL, which compresses a message of arbitrary length into a fingerprint of 128, 160, 192, 224 or 256 bits, and is very efficient and particularly suited for 32-bit computers which predominate the current workstation market.
One-way Hash function construction based on tangent-delay ellipse reflecting cavity-map system
TLDR
An algorithm for one-way Hash function construction based on tangent-delay ellipse reflecting cavity-map system (TD-ERCS) and a natural criterion to evaluate collision property of Hash function is educed in this paper.
Hash function based on chaotic tent maps
  • X. Yi
  • Computer Science, Mathematics
    IEEE Trans. Circuits Syst. II Express Briefs
  • 2005
TLDR
This brief proposes a new 2/spl lscr/ -bit iterated hash function based on chaotic tent maps that can be expected to have at least the same computational security against target attack, free-start target attacked, collision attack, semi-free-start collision attack and free- start collision attack as DM scheme.
An attack on hash function HAVAL-128
TLDR
A fast attack against hash function—HAVAL-128, where, given any 1024-bit message m, the modified message m can collide with another message m′ only with probability 1/27, where m′=m+Δm, in which Δm is a fixed difference selected in advance.
A combined chaotic cryptographic and hashing scheme
A Design Principle for Hash Functions
TLDR
Apart from suggesting a generally sound design principle for hash functions, the results give a unified view of several apparently unrelated constructions of hash functions proposed earlier, and suggests changes to other proposed constructions to make a proof of security potentially easier.
Hash function based on piecewise nonlinear chaotic map
...
...