A Secure Quantum-Resistant Mutual Authentication Protocol for RFID Systems

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.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2026-11-18
DOI
https://doi.org/10.3390/math14224240
Primary Topic
RFID technology advancements
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A Secure Quantum-Resistant Mutual Authentication Protocol for RFID Systems

Mohammed Al‐Husseini, Youssef Sellami, Pierre E. Abi-Char
4 links
Mathematics
RFID technology advancements
article

A Secure Quantum-Resistant Mutual Authentication Protocol for RFID Systems

Mohammed Al‐Husseini, Youssef Sellami, Pierre E. Abi-Char
article en

Abstract

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.

MathematicsVol. 14(22)
American University of the Middle East (KW), Capgemini (France) (FR)
RFID technology advancements
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon