Quark: A Lightweight Hash

  • Jean-Philippe Aumasson
  • Luca Henzen
  • Willi Meier
  • María Naya-Plasencia
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6225)

Abstract

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μW at 100kHz in 0.18μm ASIC. For 112-bit security, we propose t-Quark, which we implemented with 2296 gate-equivalents.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Jean-Philippe Aumasson
    • 1
  • Luca Henzen
    • 2
  • Willi Meier
    • 3
  • María Naya-Plasencia
    • 3
  1. 1.Nagravision SACheseauxSwitzerland
  2. 2.ETH ZurichSwitzerland
  3. 3.FHNWWindischSwitzerland

Personalised recommendations