René Ndoundam ; Juvet Karnel Sadie - Collision-resistant hash function based on composition of functions

arima:1949 - Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, October 27, 2011, Volume 14 - 2011 - Special issue CARI'10 - https://doi.org/10.46298/arima.1949
Collision-resistant hash function based on composition of functions

Authors: René Ndoundam ; Juvet Karnel Sadie

A cryptographic hash function is a deterministic procedure that compresses an arbitrary block of numerical data and returns a fixed-size bit string. There exists many hash functions: MD5, HAVAL, SHA, ... It was reported that these hash functions are no longer secure. Our work is focused on 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.


Volume: Volume 14 - 2011 - Special issue CARI'10
Published on: October 27, 2011
Submitted on: April 3, 2011
Keywords: NP-complete, One-way function, Matrix of zeros and ones, Three-dimensional contingency table, Collision-resistant hash function,NP-complet,fonction à un sens,Matrice des zéros et des uns,table de contingence de dimension 3,fonction de hachage résistante aux collisions,[MATH] Mathematics [math],[INFO] Computer Science [cs]


Share

Consultation statistics

This page has been seen 106 times.
This article's PDF has been downloaded 88 times.