Practical Collisions for SHAMATA-256

Sebastiaan Indesteege, Florian Mendel, Bart Preneel, Martin Schläffer

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

Abstract

In this paper, we present a collision attack on the SHA-3 submission SHAMATA. SHAMATA is a stream cipher-like hash function design with components of the AES, and it is one of the fastest submitted hash functions. In our attack, we show weaknesses in the message injection and state update of SHAMATA. It is possible to find certain message differences that do not get changed by the message expansion and non-linear part of the state update function. This allows us to find a differential path with a complexity of about 296 for SHAMATA-256 and about 2110 for SHAMATA-512, using a linear low-weight codeword search. Using an efficient guess-and-determine technique we can significantly improve the complexity of this differential path for SHAMATA-256. With a complexity of about 240 we are even able to construct practical collisions for the full hash function SHAMATA-256.
Original languageEnglish
Title of host publicationSelected Areas in Cryptography
EditorsMichael J. Jacobson, Vincent Rijmen, Reihaneh Safavi-Naini
PublisherSpringer
Pages1-15
ISBN (Print)978-364205443-3
DOIs
Publication statusPublished - 2009
EventInternational Workshop on Selected Areas in Cryptography: SAC 2009 - Calgary, Canada
Duration: 13 Aug 2009 → 14 Aug 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer
Volume5867 LNCS
ISSN (Print)1611-3349

Conference

ConferenceInternational Workshop on Selected Areas in Cryptography
Country/TerritoryCanada
CityCalgary
Period13/08/09 → 14/08/09

Access to Document

    Fingerprint

    Dive into the research topics of 'Practical Collisions for SHAMATA-256'. Together they form a unique fingerprint.
    View full fingerprint

    • EU - ECRYPT II - European network of excellence in cryptology - Phase II

      Schmidt, J.-M. (Co-Investigator (CoI)), Nad, T. (Co-Investigator (CoI)), Kirschbaum, M. (Co-Investigator (CoI)), Feldhofer, M. (Co-Investigator (CoI)), Schläffer, M. (Co-Investigator (CoI)), Aigner, M. J. (Co-Investigator (CoI)), Rechberger, C. (Co-Investigator (CoI)), Lamberger, M. (Co-Investigator (CoI)), Tillich, S. (Co-Investigator (CoI)), Medwed, M. (Co-Investigator (CoI)), Hutter, M. (Co-Investigator (CoI)), Rijmen, V. (Co-Investigator (CoI)), Mendel, F. (Co-Investigator (CoI)) & Posch, R. (Principal Investigator (PI))

      1/08/08 → 31/01/13

      Project: Research project

    • Cryptography

      Schläffer, M. (Co-Investigator (CoI)), Oswald, M. E. (Co-Investigator (CoI)), Lipp, P. (Co-Investigator (CoI)), Dobraunig, C. E. (Co-Investigator (CoI)), Mendel, F. (Co-Investigator (CoI)), Eichlseder, M. (Co-Investigator (CoI)), Nad, T. (Co-Investigator (CoI)), Posch, R. (Co-Investigator (CoI)), Lamberger, M. (Co-Investigator (CoI)), Rijmen, V. (Co-Investigator (CoI)) & Rechberger, C. (Co-Investigator (CoI))

      1/01/95 → 31/01/19

      Project: Research area

    Cite this