Spongent: A lightweight hash function

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2011

View graph of relations

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 languageEnglish
TitleCryptographic hardware and embedded systems - CHES 2011. Proceedings
Volume6917
PublisherSpringer
Publication date2011
Pages312-325
ISBN (print)9783642239502
StatePublished

Conference

Conference13th International Workshop on Cryptographic Hardware and Embedded Systems
Number13
CountryJapan
CityNara
Period28/09/1101/10/11
NameLecture Notes in Computer Science
Volume6917
ISSN (Print)0302-9743

Keywords

  • Spongent, Sponge construction, Hash function, RFID, Present, Lightweight cryptography, Low-power design, Low-cost cryptography
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 6292265