International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

A Fast Provably Secure Cryptographic Hash Function

Authors:
Daniel Augot
Matthieu Finiasz
Nicolas Sendrier
Download:
URL: http://eprint.iacr.org/2003/230
Search ePrint
Search Google
Abstract: We propose a family of fast and provably secure cryptographic hash functions. The security of these functions relies directly on the well-known syndrome decoding problem for linear codes. Attacks on this problem are well identified and their complexity is known. This enables us to study precisely the practical security of the hash functions and propose valid parameters for implementation. Furthermore, the design proposed here is fully scalable, with respect to security, hash size and output rate.
BibTeX
@misc{eprint-2003-11943,
  title={A Fast Provably Secure Cryptographic Hash Function},
  booktitle={IACR Eprint archive},
  keywords={hash functions, syndrome decoding, NP-completeness},
  url={http://eprint.iacr.org/2003/230},
  note={ matthieu.finiasz@inria.fr 12361 received 5 Nov 2003},
  author={Daniel Augot and Matthieu Finiasz and Nicolas Sendrier},
  year=2003
}