Welcome to the resource topic for 2003/230
Title:
A Fast Provably Secure Cryptographic Hash Function
Authors: Daniel Augot, Matthieu Finiasz, 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.
ePrint: https://eprint.iacr.org/2003/230
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .