Paper 2003/230
A Fast Provably Secure Cryptographic Hash Function
Daniel Augot, Matthieu Finiasz, and Nicolas Sendrier
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.
Metadata
- Available format(s)
-
PDF
PS
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- hash functionssyndrome decodingNP-completeness
- Contact author(s)
- matthieu finiasz @ inria fr
- History
- 2003-11-06: received
- Short URL
- https://ia.cr/2003/230
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2003/230,
author = {Daniel Augot and Matthieu Finiasz and Nicolas Sendrier},
title = {A Fast Provably Secure Cryptographic Hash Function},
howpublished = {Cryptology {ePrint} Archive, Paper 2003/230},
year = {2003},
url = {https://eprint.iacr.org/2003/230}
}
