Collision-resistant hash function based on composition of functions

TL;DR

This paper proposes a new collision-resistant hash function constructed through the composition of functions, leveraging NP-completeness and relaxing traditional compression constraints to enhance security.

Contribution

It introduces a novel hash function design based on function composition and computational complexity theory, differing from traditional hash functions.

Findings

The proposed hash function demonstrates resistance to collision attacks.

The construction exploits NP-completeness of three-dimensional contingency tables.

Relaxing compression constraints offers new avenues for hash function design.

Abstract

cryptographic hash function is a deterministic procedure that compresses an arbitrary block of numerical data and returns a fixed-size bit string. There exist many hash functions: MD5, HAVAL, SHA, ... It was reported that these hash functions are not longer secure. Our work is focused in the construction of a new hash function based on composition of functions. The construction used the NP-completeness of Three-dimensional contingency tables and the relaxation of the constraint that a hash function should also be a compression function.