Spongent: A lightweight hash function

Andrey Bogdanov; Miroslav Knežević; Gregor Leander; Deniz Toz; Kerem Varici; Ingrid Verbauwhede

Spongent: A lightweight hash function

Andrey Bogdanov, Miroslav Knežević, Gregor Leander, Deniz Toz, Kerem Varici, Ingrid Verbauwhede

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

Abstract

This paper proposes spongent - a family of lightweight hash functions with hash sizes of 88 (for preimage resistance only), 128, 160, 224, and 256 bits based on a sponge construction instantiated with a present-type permutation, following the hermetic sponge strategy. Its smallest implementations in ASIC require 738, 1060, 1329, 1728, and 1950 GE, respectively. To our best knowledge, at all security levels attained, it is the hash function with the smallest footprint in hardware published so far, the parameter being highly technology dependent. spongent offers a lot of flexibility in terms of serialization degree and speed. We explore some of its numerous implementation trade-offs. We furthermore present a security analysis of spongent. Basing the design on a present-type primitive provides confidence in its security with respect to the most important attacks. Several dedicated attack approaches are also investigated. © 2011 International Association for Cryptologic Research.

Original language	English
Title of host publication	Cryptographic hardware and embedded systems - CHES 2011. Proceedings
Volume	6917
Publisher	Springer
Publication date	2011
Pages	312-325
ISBN (Print)	9783642239502
Publication status	Published - 2011
Event	13th International Workshop on Cryptographic Hardware and Embedded Systems - Nara, Japan Duration: 28 Sept 2011 → 1 Oct 2011 Conference number: 13

Conference

Conference	13th International Workshop on Cryptographic Hardware and Embedded Systems
Number	13
Country/Territory	Japan
City	Nara
Period	28/09/2011 → 01/10/2011

Series	Lecture Notes in Computer Science
Volume	6917
ISSN	0302-9743

Keywords

Spongent
Sponge construction
Hash function
RFID
Present
Lightweight cryptography
Low-power design
Low-cost cryptography

OpenUrl availability

Full text

Cite this

@inproceedings{56e05182fcf644c387e8f2dc1a6a0287,

title = "Spongent: A lightweight hash function",

abstract = "This paper proposes spongent - a family of lightweight hash functions with hash sizes of 88 (for preimage resistance only), 128, 160, 224, and 256 bits based on a sponge construction instantiated with a present-type permutation, following the hermetic sponge strategy. Its smallest implementations in ASIC require 738, 1060, 1329, 1728, and 1950 GE, respectively. To our best knowledge, at all security levels attained, it is the hash function with the smallest footprint in hardware published so far, the parameter being highly technology dependent. spongent offers a lot of flexibility in terms of serialization degree and speed. We explore some of its numerous implementation trade-offs. We furthermore present a security analysis of spongent. Basing the design on a present-type primitive provides confidence in its security with respect to the most important attacks. Several dedicated attack approaches are also investigated. {\textcopyright} 2011 International Association for Cryptologic Research.",

keywords = "Spongent, Sponge construction, Hash function, RFID, Present, Lightweight cryptography, Low-power design, Low-cost cryptography",

author = "Andrey Bogdanov and Miroslav Kne{\v z}evi{\'c} and Gregor Leander and Deniz Toz and Kerem Varici and Ingrid Verbauwhede",

year = "2011",

language = "English",

isbn = "9783642239502",

volume = "6917",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "312--325",

booktitle = "Cryptographic hardware and embedded systems - CHES 2011. Proceedings",

note = "13th International Workshop on Cryptographic Hardware and Embedded Systems, CHES 2011 ; Conference date: 28-09-2011 Through 01-10-2011",

}

Bogdanov, A, Knežević, M, Leander, G, Toz, D, Varici, K & Verbauwhede, I 2011, Spongent: A lightweight hash function. in Cryptographic hardware and embedded systems - CHES 2011. Proceedings. vol. 6917, Springer, Lecture Notes in Computer Science, vol. 6917, pp. 312-325, 13th International Workshop on Cryptographic Hardware and Embedded Systems, Nara, Japan, 28/09/2011.

Spongent: A lightweight hash function. / Bogdanov, Andrey; Knežević, Miroslav; Leander, Gregor et al.
Cryptographic hardware and embedded systems - CHES 2011. Proceedings. Vol. 6917 Springer, 2011. p. 312-325 (Lecture Notes in Computer Science, Vol. 6917).

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

TY - GEN

T1 - Spongent: A lightweight hash function

AU - Bogdanov, Andrey

AU - Knežević, Miroslav

AU - Leander, Gregor

AU - Toz, Deniz

AU - Varici, Kerem

AU - Verbauwhede, Ingrid

N1 - Conference code: 13

PY - 2011

Y1 - 2011

N2 - This paper proposes spongent - a family of lightweight hash functions with hash sizes of 88 (for preimage resistance only), 128, 160, 224, and 256 bits based on a sponge construction instantiated with a present-type permutation, following the hermetic sponge strategy. Its smallest implementations in ASIC require 738, 1060, 1329, 1728, and 1950 GE, respectively. To our best knowledge, at all security levels attained, it is the hash function with the smallest footprint in hardware published so far, the parameter being highly technology dependent. spongent offers a lot of flexibility in terms of serialization degree and speed. We explore some of its numerous implementation trade-offs. We furthermore present a security analysis of spongent. Basing the design on a present-type primitive provides confidence in its security with respect to the most important attacks. Several dedicated attack approaches are also investigated. © 2011 International Association for Cryptologic Research.

AB - This paper proposes spongent - a family of lightweight hash functions with hash sizes of 88 (for preimage resistance only), 128, 160, 224, and 256 bits based on a sponge construction instantiated with a present-type permutation, following the hermetic sponge strategy. Its smallest implementations in ASIC require 738, 1060, 1329, 1728, and 1950 GE, respectively. To our best knowledge, at all security levels attained, it is the hash function with the smallest footprint in hardware published so far, the parameter being highly technology dependent. spongent offers a lot of flexibility in terms of serialization degree and speed. We explore some of its numerous implementation trade-offs. We furthermore present a security analysis of spongent. Basing the design on a present-type primitive provides confidence in its security with respect to the most important attacks. Several dedicated attack approaches are also investigated. © 2011 International Association for Cryptologic Research.

KW - Spongent

KW - Sponge construction

KW - Hash function

KW - RFID

KW - Present

KW - Lightweight cryptography

KW - Low-power design

KW - Low-cost cryptography

M3 - Article in proceedings

SN - 9783642239502

VL - 6917

T3 - Lecture Notes in Computer Science

SP - 312

EP - 325

BT - Cryptographic hardware and embedded systems - CHES 2011. Proceedings

PB - Springer

T2 - 13th International Workshop on Cryptographic Hardware and Embedded Systems

Y2 - 28 September 2011 through 1 October 2011

ER -

Spongent: A lightweight hash function

Abstract

Conference

Keywords

OpenUrl availability

Fingerprint

Cite this