Hash Functions and RFID Tags: Mind the Gap

  • Authors:
  • Andrey Bogdanov;Gregor Leander;Christof Paar;Axel Poschmann;Matt J. Robshaw;Yannick Seurin

  • Affiliations:
  • Horst Görtz Institute for IT Security, Ruhr-University Bochum, Germany;Horst Görtz Institute for IT Security, Ruhr-University Bochum, Germany;Horst Görtz Institute for IT Security, Ruhr-University Bochum, Germany;Horst Görtz Institute for IT Security, Ruhr-University Bochum, Germany;Orange Labs, Issy les Moulineaux, France;Orange Labs, Issy les Moulineaux, France

  • Venue:
  • CHES '08 Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The security challenges posed by RFID-tag deployments are well-known. In response there is a rich literature on new cryptographic protocols and an on-tag hash function is often assumed by protocol designers. Yet cheap tags pose severe implementation challenges and it is far from clear that a suitable hash function even exists. In this paper we consider the options available, including constructions based around compact block ciphers. While we describe the most compact hash functions available today, our work serves to highlight the difficulties in designing lightweight hash functions and (echoing [17]) we urge caution when routinely appealing to a hash function in an RFID-tag protocol.