Answers are grounded in this paper and cite their sources.
Radio Frequency Identification (RFID) systems play a key role in the Internet of Things (IoT), but their limited computational and storage capabilities make the design of secure authentication protocols particularly challenging. Moreover, most existing RFID authentication schemes rely on classical cryptographic assumptions that are vulnerable to quantum computing attacks or introduce excessive overhead for resource-constrained tags. In this paper, we propose a lightweight post-quantum RFID mutual authentication protocol based on the hardness of the Inhomogeneous Short Integer Solution (ISIS) problem. The proposed protocol replaces permutation operations with a random masking vector mechanism, reducing computational complexity while preserving security. Furthermore, a seed-based matrix generation technique is adopted to minimize storage and communication overhead by reconstructing the public matrix on demand. The protocol provides mutual authentication between the tag, reader, and server, while resisting common attacks, including replay, impersonation, man-in-the-middle, traceability, and desynchronization attacks. Security analysis demonstrates the robustness of the proposed scheme, and performance evaluation shows that it achieves lower computational, communication, and storage overhead than existing post-quantum RFID authentication protocols, making it suitable for practical RFID deployments.
No takes yet. Share an insight, caveat, or question.
Abi-Char et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: