International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Linearization Attacks Against Syndrome Based Hashes

Authors:
Markku-Juhani Olavi Saarinen
Download:
URL: http://eprint.iacr.org/2007/295
Search ePrint
Search Google
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 $2^128$ security.
BibTeX
@misc{eprint-2007-13575,
  title={Linearization Attacks Against Syndrome Based Hashes},
  booktitle={IACR Eprint archive},
  keywords={secret-key cryptography / hash function cryptanalysis, provable security, linearization attack, FSB},
  url={http://eprint.iacr.org/2007/295},
  note={INDOCRYPT 2007 m.saarinen@rhul.ac.uk 13781 received 31 Jul 2007, last revised 25 Sep 2007},
  author={Markku-Juhani Olavi Saarinen},
  year=2007
}