2014•Jisuanji fangzhenRequires access

An Improved Anti-Collision Hash Function Construction Algorithm

Ya Zhou

Open publisher page 0 citations

Abstract

For the problem that traditional hash functions such as MD5 and SHA will collide easily,on the base of analyzing the collision probability for hash function,we proposed an improved hash function construction algorithm. With the characteristics such as state discrete and parallel iteration for cellular automata,on the base of analyzing the ECM( Encryption Checksum) iterative structure,we improved the ECM iterative structure. After the computation of compression function and before the ECM iteration,we conducted an elementary cellular automata transformation to enhance the randomness of hash function and solve the problem of collision easily. Simulation results show that the improved hash function has better hash characteristics and anti- collision performance compared with other hash functions.

About this research paper

What this paper is about

For the problem that traditional hash functions such as MD5 and SHA will collide easily,on the base of analyzing the collision probability for hash function,we proposed an improved hash function construction algorithm. With the characteristics such as state discrete and parallel iteration for cellular automata,on the base of analyzing the ECM( Encryption Checksum) iterative structure,we improved the ECM iterative structure. After the computation of compression function and before the ECM iteration,we conducted an elementary cellular automata transformation to enhance the randomness of hash function and solve the problem of collision easily. Simulation results show that the improved hash function has better hash characteristics and anti- collision performance compared with other hash functions.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

For the problem that traditional hash functions such as MD5 and SHA will collide easily,on the base of analyzing the collision probability for hash function,we proposed an improved hash function construction algorithm. With the characteristics such as state discrete and parallel iteration for cellular automata,on the base of analyzing the ECM( Encryption Checksum) iterative structure,we improved the ECM iterative structure. After the computation of compression function and before the ECM iteration,we conducted an elementary cellular automata transformation to enhance the randomness of hash function and solve the problem of collision easily. Simulation results show that the improved hash function has better hash characteristics and anti- collision performance compared with other hash functions.

Key concepts: Hash function, Rolling hash, Collision resistance, Double hashing, SHA-2, MDC-2, Collision attack, Cryptographic hash function

Related papers

Back to paper searchBrowse research topicsOriginal source
An Improved Anti-Collision Hash Function Construction Algorithm — Research Paper | ScholarLens