Paper 2009/092 Original: eprint.iacr.org/2009/092 ↗
Reducing RFID Reader Load with the Meet-in-the-Middle Strategy
Abstract
In almost any RFID system, a reader needs to identify, and optionally authenticate, a multitude of tags. If each tag has a unique secret, identification and authentication are trivial, however, the reader (or a back-end server) needs to perform a brute-force search for each tag-reader interaction. In this paper, we suggest a simple, efficient and secure technique that reduces reader computation to $O(\sqrt N \cdot \log N)$. Our technique is based on the well-known ``meet-in-the-middle'' strategy used in the past to attack certain symmetric ciphers.
Metadata
- Available format(s)
PDF- Category
- Applications
- Publication info
- Preprint.
- History
- 2009-02-24: last updated
- 2009-02-24: published
- Short URL
- https://ia.cr/2009/092
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2009/092,
author = {Jung Hee Cheon and Jeongdae Hong and Gene Tsudik},
title = {Reducing RFID Reader Load with the Meet-in-the-Middle Strategy},
howpublished = {Cryptology {ePrint} Archive, Paper 2009/092},
year = {2009},
url = {https://eprint.iacr.org/2009/092}
}