Advertisement
Published in:
2011 | OriginalPaper | Chapter
spongent: A Lightweight Hash Function
Authors : Andrey Bogdanov, Miroslav Knežević, Gregor Leander, Deniz Toz, Kerem Varıcı, Ingrid Verbauwhede
Published in: Cryptographic Hardware and Embedded Systems – CHES 2011
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.