Improved fast syndrome based cryptographic hash functions

by Daniel Augot , Matthieu Finiasz , Nicolas Sendrier
Venue:in Proceedings of ECRYPT Hash Workshop 2007 (2007). URL: http://www-roc.inria.fr/secret/Matthieu.Finiasz
Citations:24 - 5 self

Documents Related by Co-Citation

85 A new algorithm for finding minimum-weight words in a linear code: application to primitive narrow-sense BCH codes of length 511 – Florent Chabaud, Anne Canteaut, Anne Canteaut, Et Florent Chabaud, Projet Codes - 1998
93 A Generalized Birthday Problem – David Wagner - 2002
14 Cryptanalysis of a Provably Secure Cryptographic Hash Function – Jean-Sebastien Coron, Antoine Joux - 2004
197 A public-key cryptosystem based on algebraic coding theory – R J MCELIECE - 1978
51 An observation on the security of McEliece’s public key cryptosystem – P J LEE, E F BRICKELL - 1989
223 Tilborg, On the inherent intractability of certain coding problems – E R Berlekamp, R J McEliece, H C A van - 1978
61 How to achieve a McEliece-based digital signature scheme – Nicolas Courtois, Matthieu Finiasz, Nicolas Sendrier - 2001
29 QUAD: a Practical Stream Cipher with Provable Security – Côme Berbain, Henri Gilbert, Jacques Patarin - 2006
8 Linearization attacks against syndrome based hashes. Cryptology ePrint Archive, Report 2007/295 – Markku-juhani O. Saarinen - 2007
49 A method for finding codewords of small weight – J Stern - 1989
8 The extended k-tree algorithm – Lorenz Minder, Alistair Sinclair
79 A new paradigm for collision-free hashing: incrementality at reduced cost – Mihir Bellare, Daniele Micciancio - 1997
47 A probabilistic algorithm for computing minimum weights of large error-correcting codes – J S Leon - 1988
9 A Fast Provably Secure Cryptographic Hash Function – Daniel Augot, Matthieu Finiasz, Nicolas Sendrier - 1996
8 Asymptotic improvement of the Gilbert-Varshamov bound for linear codes – Philippe Gaborit, Gilles Zémor - 2006
33 Security Bounds for the Design of Code-Based Cryptosystems – Matthieu Finiasz, Nicolas Sendrier - 2009
10 an Efficient and Provable CollisionResistant Hash Function – VSH - 2006
5 Better price-performance ratios for generalized birthday attacks – Daniel J. Bernstein
6 FSBday: Implementing Wagner’s generalized birthday attack against the SHA-3 ⋆ round-1 candidate FSB – Daniel J. Bernstein, Tanja Lange, Ruben Niederhagen, Christiane Peters, Peter Schwabe