Collision-resistant hash function based on composition of functions
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.
Keywords
Cite
@article{arxiv.1108.1478,
title = {Collision-resistant hash function based on composition of functions},
author = {Rene Ndoundam and Juvet Karnel Sadie},
journal= {arXiv preprint arXiv:1108.1478},
year = {2011}
}
Comments
18 pages, 1 figure. The preliminary version of this paper was published in the Conference CARI'10, pages 141-148, Yamoussoukro, Ivory Coast. The preliminary version was also published in the arXiv August 6, 2011 under number arXiv:1108.1478v1. This version was submittted to the journal ARIMA (January 2011)