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\text{\%}$ in terms of communication data compared to the most recent code-based authentication protocols for RFID systems.

本文提出了基于秩度量代码的难题的第一个用于RFID系统的相互认证协议，并讨论了在后量子场景中的安全性。此外，我们的协议使用了两项改进。第一种方法是使用双循环低秩奇偶校验码，与以前的基于代码的协议相比，它可以降低通信成本并获得更小的密钥大小。第二个方法是使用哈希函数来获取完整的内部保密属性。而且，我们的协议至少可以节省 $42\text{％}$ 与最新的RFID系统基于代码的身份验证协议相比，在通信数据方面而言。