Cryptanalysis of the LAKE Hash Family

Alex Biryukov, Praveen Gauravaram, Jian Guo, Dmitry Khovratovich, San Ling, Krystian Matusiewicz, Ivica Nikolić, Josef Pieprzyk, Huaxiong Wang

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    Abstract

    We analyse the security of the cryptographic hash function LAKE-256 proposed at FSE 2008 by Aumasson, Meier and Phan. By exploiting non-injectivity of some of the building primitives of LAKE, we show three different collision and near-collision attacks on the compression function. The first attack uses differences in the chaining values and the block counter and finds collisions with complexity 233. The second attack utilizes differences in the chaining values and salt and yields collisions with complexity 242. The final attack uses differences only in the chaining values to yield near-collisions with complexity 299. All our attacks are independent of the number of rounds in the compression function. We illustrate the first two attacks by showing examples of collisions and near-collisions.
    Original languageEnglish
    Title of host publicationFast Software Encryption
    EditorsOrr Dunkelman
    Number of pages415
    Volume5665
    Place of PublicationBerlin / Heidelberg
    PublisherSpringer
    Publication date2009
    Pages156-179
    DOIs
    Publication statusPublished - 2009
    EventFast Software Encryption 2009 - Leuven, Belgium
    Duration: 22 Feb 200925 Feb 2009
    Conference number: 16
    http://www.informatik.uni-trier.de/~ley/db/conf/fse/fse2009.html

    Conference

    ConferenceFast Software Encryption 2009
    Number16
    CountryBelgium
    CityLeuven
    Period22/02/200925/02/2009
    Internet address
    SeriesLecture Notes in Computer Science
    Number5665
    ISSN0302-9743

    Keywords

    • cryptanalysis
    • collision attacks
    • LAKE hash family

    Fingerprint Dive into the research topics of 'Cryptanalysis of the LAKE Hash Family'. Together they form a unique fingerprint.

    Cite this