Date Added: Dec 2011
The design of secure yet efficiently implementable cryptographic algorithms is a fundamental problem of cryptography. Lately, lightweight cryptography - optimizing the algorithms to t the most constrained environments - has received a great deal of attention, the recent research being mainly focused on building block ciphers. As opposed to that, the design of lightweight hash functions is still far from being well-investigated with only few proposals in the public domain. In this paper, the authors aim to address this gap by exploring the design space of lightweight hash functions based on the sponge construction instantiated with present-type permutations.