A Generalized Birthday Problem
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Linearization attacks against syndrome based hashes
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Cryptanalysis of a hash function based on quasi-cyclic codes
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
A family of fast syndrome based cryptographic hash functions
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
QUAD: a practical stream cipher with provable security
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
IEEE Transactions on Information Theory
Efficient Constructions of Deterministic Encryption from Hybrid Encryption and Code-Based PKE
AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Interpreting hash function security proofs
ProvSec'10 Proceedings of the 4th international conference on Provable security
Faster 2-regular information-set decoding
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Really fast syndrome-based hashing
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Faster and smoother: VSH revisited
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
| Hi-index | 0.00 |
Hash functions are a hot topic at the moment in cryptography. Many proposals are going to be made for SHA-3, and among them, some provably collision resistant hash functions might also be proposed. These do not really compete with "standard" designs as they are usually much slower and not well suited for constrained environments. However, they present an interesting alternative when speed is not the main objective. As always when dealing with provable security, hard problems are involved, and the fast syndrome-based cryptographic hash function proposed by Augot, Finiasz and Sendrier at Mycrypt 2005 relies on the problem of Syndrome Decoding, a well known "Post Quantum" problem from coding theory. In this article we review the different variants and attacks against it so as to clearly point out which choices are secure and which are not.