Rank-metric code-based mutual authentication protocol for RFID

Abstract

This paper presents the first mutual authentication protocol for RFID systems based on hard problems from rank metric codes, and we discuss its security in the post quantum scenario. Furthermore, our protocol uses two improvements. The first one consists in using double circulant low rank parity check codes and permits to reduce communication costs and to get smaller key size than previous code-based protocols. The second one consists in using a hash function to get the full inside secrecy property. Moreover, our protocol saves at least 42% in terms of communication data compared to the most recent code-based authentication protocols for RFID systems.