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

arima:1949 - Revue Africaine de 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 1; Juvet Karnel Sadie 2

  • 1 Laboratoire de Calcul Parallèle
  • 2 Laboratoire International de Recherche en Informatique et Mathématiques Appliquées

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.

https://doi.org/10.46298/arima.1949
Source: HAL:hal-01299415v1
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]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo DOI 10.1007/978-0-8176-4842-8_17
Source : ScholeXplorer IsRelatedTo DOI 10.2140/pjm.1957.7.1073
  • 10.1007/978-0-8176-4842-8_17
  • 10.2140/pjm.1957.7.1073
  • 10.2140/pjm.1957.7.1073
A theorem on flows in networks

Share and export

Consultation statistics

This page has been seen 214 times.
This article's PDF has been downloaded 347 times.