Linearization Attacks Against Syndrome Based Hashes

Abstract. In MyCrypt 2005, Augot, Finiasz, and Sendrier proposed FSB, a family of cryptographic hash functions. The security claim of the FSB hashes is based on a coding theory problem with hard average-case complexity. In the ECRYPT 2007 Hash Function Workshop, new versions with essentially the same compression function but radically different security parameters and an additional final transformation were presented. We show that hardness of average-case complexity of the underlying problem is irrelevant in collision search by presenting a linearization method that can be used to produce collisions in a matter of seconds on a desktop PC for the variant of FSB with claimed 2128 security.

• Type: Conference
• Year: 2007
• Where: INDOCRYPT
• Authors: Markku-Juhani Olavi Saarinen
• Keywords: Average-case Complexity, Hash Function, INDOCRYPT 2007, Sendrier Proposed Fsb