## Cryptology ePrint Archive: Report 2009/092

Jung Hee Cheon and Jeongdae Hong and Gene Tsudik

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.

Category / Keywords: applications/RFID Identification, Authentication, Meet-in-the-Middle Strategy, PRF

Date: received 21 Feb 2009, last revised 21 Feb 2009

Contact author: jhcheon at snu ac kr

Available format(s): PDF | BibTeX Citation

Short URL: ia.cr/2009/092

[ Cryptology ePrint archive ]