Quark: a lightweight hash. (English) Zbl 1297.94043

Mangard, Stefan (ed.) et al., Cryptographic hardware and embedded systems – CHES 2010. 12th international workshop, Santa Barbara, USA, August 17–20, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15030-2/pbk). Lecture Notes in Computer Science 6225, 1-15 (2010).
Summary: The need for lightweight cryptographic hash functions has been repeatedly expressed by application designers, notably for implementing RFID protocols. However not many designs are available, and the ongoing SHA-3 Competition probably won’t help, as it concerns general-purpose designs and focuses on software performance. In this paper, we thus propose a novel design philosophy for lightweight hash functions, based on a single security level and on the sponge construction, to minimize memory requirements. Inspired by the lightweight ciphers Grain and KATAN, we present the hash function family Quark, composed of the three instances u-Quark, d-Quark, and t-Quark. Hardware benchmarks show that Quark compares well to previous lightweight hashes. For example, our lightest instance u-Quark conjecturally provides at least 64-bit security against all attacks (collisions, multicollisions, distinguishers, etc.), fits in 1379 gate-equivalents, and consumes in average \(2.44\mu \)W at 100kHz in \(0.18\mu \)m ASIC. For 112-bit security, we propose t-Quark, which we implemented with 2296 gate-equivalents.
For the entire collection see [Zbl 1193.68012].


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


Full Text: DOI