The Grindahl Hash Functions

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

The Grindahl Hash Functions

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

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-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 language	English
Title of host publication	Fast Software Encryption : 14th International Workshop, FSE 2007, Luxembourg, Luxembourg, March 26-28, 2007, Revised Selected Papers
Editors	Alex Biryukov
Publisher	Springer
Publication date	2007
Pages	39-57
ISBN (Print)	978-3-540-74617-1
Publication status	Published - 2007
Event	14th Annual Fast Software Encryption - Luxembourg, Luxembourg Duration: 26 Mar 2007 → 28 Mar 2007 Conference number: 14 http://fse2007.uni.lu/

Workshop

Workshop	14th Annual Fast Software Encryption
Number	14
Country/Territory	Luxembourg
City	Luxembourg
Period	26/03/2007 → 28/03/2007
Internet address	http://fse2007.uni.lu/

Series	Lecture Notes in Computer Science
Number	4593

SFX availability

Full text

Cite this

@inproceedings{0e8782b52167469e83758db6f64be52e,

title = "The Grindahl Hash Functions",

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.",

author = "Knudsen, {Lars Ramkilde} and Christian Rechberger and Thomsen, {S{\o}ren Steffen}",

year = "2007",

language = "English",

isbn = "978-3-540-74617-1",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

number = "4593",

pages = "39--57",

editor = "Alex Biryukov",

booktitle = "Fast Software Encryption",

note = "14th Annual Fast Software Encryption, FSE 2007 ; Conference date: 26-03-2007 Through 28-03-2007",

url = "http://fse2007.uni.lu/",

}

Knudsen, LR, Rechberger, C & Thomsen, SS 2007, The Grindahl Hash Functions. in A Biryukov (ed.), Fast Software Encryption: 14th International Workshop, FSE 2007, Luxembourg, Luxembourg, March 26-28, 2007, Revised Selected Papers. Springer, Lecture Notes in Computer Science, no. 4593, pp. 39-57, 14th Annual Fast Software Encryption, Luxembourg, Luxembourg, 26/03/2007.

The Grindahl Hash Functions. / Knudsen, Lars Ramkilde; Rechberger, Christian; Thomsen, Søren Steffen.

Fast Software Encryption: 14th International Workshop, FSE 2007, Luxembourg, Luxembourg, March 26-28, 2007, Revised Selected Papers. ed. / Alex Biryukov. Springer, 2007. p. 39-57 (Lecture Notes in Computer Science; No. 4593).

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

TY - GEN

T1 - The Grindahl Hash Functions

AU - Knudsen, Lars Ramkilde

AU - Rechberger, Christian

AU - Thomsen, Søren Steffen

N1 - Conference code: 14

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

M3 - Article in proceedings

SN - 978-3-540-74617-1

T3 - Lecture Notes in Computer Science

SP - 39

EP - 57

BT - Fast Software Encryption

A2 - Biryukov, Alex

PB - Springer

T2 - 14th Annual Fast Software Encryption

Y2 - 26 March 2007 through 28 March 2007

ER -

The Grindahl Hash Functions

Abstract

Workshop

SFX availability

Fingerprint

Cite this