The Grindahl Hash Functions

Lars Ramkilde Knudsen, Christian Rechberger, Søren Steffen Thomsen

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

    Abstract

    In this paper we propose the Grindahl hash functions, which are based on components of the Rijndael algorithm. To make collision search sufficiently difficult, this design has the important feature that no low-weight characteristics form collisions, and at the same time it limits access to the state. We propose two concrete hash functions, Grindahl-256 and Grindahl-512 with claimed security levels with respect to collision, preimage and second preimage attacks of 2^128 and 2^256, respectively. Both proposals have lower memory requirements than other hash functions at comparable speeds and security levels.
    Original languageEnglish
    Title of host publicationFast Software Encryption : 14th International Workshop, FSE 2007, Luxembourg, Luxembourg, March 26-28, 2007, Revised Selected Papers
    EditorsAlex Biryukov
    PublisherSpringer
    Publication date2007
    Pages39-57
    ISBN (Print)978-3-540-74617-1
    Publication statusPublished - 2007
    Event14th Annual Fast Software Encryption - Luxembourg, Luxembourg
    Duration: 26 Mar 200728 Mar 2007
    Conference number: 14
    http://fse2007.uni.lu/

    Workshop

    Workshop14th Annual Fast Software Encryption
    Number14
    Country/TerritoryLuxembourg
    CityLuxembourg
    Period26/03/200728/03/2007
    Internet address
    SeriesLecture Notes in Computer Science
    Number4593

    Fingerprint

    Dive into the research topics of 'The Grindahl Hash Functions'. Together they form a unique fingerprint.

    Cite this