Lightweight Hashing Using Lesamnta-LW Compression Function Mode and MDP Domain Extension

Abstract

This paper presents a block-cipher-based hashing scheme suitable for resource constrained devices. It uses the Lesamnta-LW compression function mode and the MDP domain extension. Then, this paper provides provable security analyses of the proposed scheme. It is shown that the proposed scheme is both collision-resistant and preimage-resistant up to the birthday bound in the ideal cipher model. It is also shown that the proposed scheme in the keyed-via-IV mode is a pseudorandom function if the underlying block cipher is a pseudorandom permutation. These results imply that the proposed scheme has the same level of security as the original Lesamnta-LW hashing scheme. Unlike the original Lesamnta-LW hashing scheme, the keyed-via-IV mode of the proposed scheme does not require output truncation. This property is useful when the proposed scheme is used for pseudorandom sequence generation.