Advertisement

Linearization Attacks Against Syndrome Based Hashes

  • Markku-Juhani O. Saarinen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4859)

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.

Keywords

FSB Syndrome Based Hashes Provably Secure Hashes Hash Function Cryptanalysis Linearization Attack 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Augot, D., Finiasz, M., Sendrier, N.: A family of fast syndrome based cryptographic hash functions. In: Dawson, E., Vaudenay, S. (eds.) DILS 2005. LNCS (LNBI), vol. 3615, pp. 64–83. Springer, Heidelberg (2005)Google Scholar
  2. 2.
    Bentahar, K., Page, D., Saarinen, M.-J.O., Silverman, J.H., Smart, N.: LASH. In: Proc. 2nd NIST Cryptographic Hash Workshop (2006)Google Scholar
  3. 3.
    Contini, S., Lenstra, A.K., Steinfeld, R.: VSH, an efficient and provably collision-resistant hash function. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 165–182. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  4. 4.
    Coron, J.-S., Joux, A.: Cryptanalysis of a provably secure cryptographic hash function. IACR ePrint 2004 / 013 (2004), Available at http://www.iacr.org/eprint
  5. 5.
    Damgård, I.B.: A design principle for hash functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 416–427. Springer, Heidelberg (1990)Google Scholar
  6. 6.
    Finiasz, M., Gaborit, P., Sendrier, N.: Improved fast syndrome based cryptographic hash functions. In: ECRYPT Hash Function Workshop 2007 (2007)Google Scholar
  7. 7.
    Merkle, R.C.: A fast software one-way hash function. Journal of Cryptology 3, 43–58 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Saarinen, M.-J.O.: Security of VSH in the real world. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol. 4329, pp. 95–103. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  9. 9.
    Rijmen, V., Barreto, P.: ”Whirlpool”. Seventh hash function of ISO/IEC 10118-3:2004 (2004)Google Scholar
  10. 10.
    Wagner, D.: A generalized birthday problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 288–304. Springer, Heidelberg (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Markku-Juhani O. Saarinen
    • 1
  1. 1.Information Security Group, Royal Holloway, University of London, Egham, Surrey TW20 0EXUK

Personalised recommendations