Compression functions using a dedicated blockcipher for lightweight hashing. (English) Zbl 1365.94434

Kim, Howon (ed.), Information security and cryptology – ICISC 2011. 14th international conference, Seoul, Korea, November 30–December 2, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-31911-2/pbk). Lecture Notes in Computer Science 7259, 346-364 (2012).
Summary: This article presents a model of compression functions using a blockcipher for lightweight hashing on memory-constrained devices. The novelty of the proposed model is that the key length of the underlying blockcipher is half of its block length, which enables the reduction of the size of the internal state without sacrificing the security. Security of iterated hash functions composed of compression functions in the model is also discussed. First, their collision resistance and preimage resistance are quantified in the ideal cipher model. Then, a keyed hashing mode is defined, and its security as a pseudorandom function is reduced to the security of the underlying blockcipher as a pseudorandom permutation. The analysis supports the security of Lesamnta-LW, which is a lightweight hash function proposed in ICISC 2010. Finally, preimage resistance is quantified assuming a computationally secure blockcipher.
For the entire collection see [Zbl 1248.68040].


94A60 Cryptography
68P25 Data encryption (aspects in computer science)


Full Text: DOI