Hash functions based on block ciphers: a synthetic approach
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Randomized algorithms
Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Pseudorandom functions revisited: the cascade construction and its concrete security
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
MAME: A Compression Function with Reduced Hardware Requirements
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
PRESENT: An Ultra-Lightweight Block Cipher
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
Hash Functions and RFID Tags: Mind the Gap
CHES '08 Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems
Blockcipher-Based Hashing Revisited
Fast Software Encryption
A simple variant of the Merkle-Damgård scheme with a permutation
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
CHES'10 Proceedings of the 12th international conference on Cryptographic hardware and embedded systems
The PHOTON family of lightweight Hash functions
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
A lightweight 256-bit hash function for hardware and low-end devices: lesamnta-LW
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
SPONGENT: a lightweight hash function
CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
A failure-friendly design principle for hash functions
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
| Hi-index | 0.00 |
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.