RFID Security Using Lightweight Mutual Authentication And Ownership Transfer Protocol

In recent years, radio frequency identification technology has moved into the mainstream applications that help to speed up handling of manufactured goods and materials. RFID tags are divided into two classes: active and passive. Active tag requires a power source that’s why its cost is more than passive tags. However, the low-cost RFID tags are facing new challenges to security and privacy. Some solutions utilize expensive cryptographic primitives such as hash or encryption functions, and some lightweight approaches have been reported to be not secure. This paper describes a lightweight Mutual authentication and ownership transfer protocol utilizing minimalistic cryptography using Physically Unclonable Functions (PUF) and Linear Feedback Shift Registers (LFSR). PUFs and LFSRs are very efficient in hardware and particularly suitable for the low-cost RFID tags. To functioning security in low cost RFID tag minimum gate requirement is 2000 gates. To implement security protocols using PUF and LFSR functions need only approx 800 gates. In this paper it is explained how we can authenticate and transfer ownership of low cost RFID tag securely using LFSR and PUF as compared to existing solutions based on hash functions.

💡 Research Summary

The paper addresses the pressing need for secure yet ultra‑lightweight authentication and ownership‑transfer mechanisms for low‑cost passive RFID tags, which are increasingly deployed in supply‑chain and logistics applications. Traditional security solutions for RFID—hash‑based authentication, symmetric‑key ciphers such as AES or PRESENT, and even public‑key schemes—generally require more than the 2 000‑gate hardware budget that is realistic for inexpensive tags, and they also consume excessive power. To overcome these constraints, the authors propose a novel protocol that combines two hardware‑efficient primitives: Physically Unclonable Functions (PUFs) and Linear Feedback Shift Registers (LFSRs).

A PUF exploits minute manufacturing variations to produce a unique, unclonable response for each tag without storing a secret key. The paper implements SRAM‑PUF and Arbiter‑PUF designs that occupy roughly 250–300 gates each, well within the target budget. Because the PUF output is intrinsically tied to the physical silicon, an adversary cannot duplicate or predict it, providing a strong source of entropy and a “hardware root of trust.”

LFSRs generate pseudo‑random bit streams using simple linear feedback logic. The authors employ a 4‑bit LFSR with a 3‑bit feedback polynomial, requiring only about 120 gates and delivering one bit per clock cycle. By XOR‑combining the LFSR output with the PUF response, the protocol derives a fresh session key for every communication round, eliminating the need for stored symmetric keys.

The protocol proceeds in four steps: (1) the reader sends a random challenge r₁; (2) the tag computes PUF(r₁), mixes it with the LFSR output, and returns a response s₁ together with a new random challenge r₂; (3) the reader reproduces the same PUF‑LFSR computation, verifies s₁, and, upon successful verification, issues an ownership‑transfer token containing the current owner’s authentication data and initialization parameters for the new owner; (4) the new owner updates its internal PUF‑LFSR parameters and can subsequently authenticate using the same lightweight steps.

Security analysis covers confidentiality, integrity, mutual authentication, replay resistance, and secure ownership transfer. Replay attacks are thwarted because each session uses fresh nonces (r₁, r₂) and the tag’s PUF response, which cannot be reused. Man‑in‑the‑middle attacks are infeasible because an attacker would need to predict the PUF output of both parties, which is physically unclonable. Power‑analysis resistance is achieved by performing the PUF and LFSR operations in a short, fixed‑time window, making the power trace indistinguishable across sessions.

Performance evaluation, carried out via hardware description language (HDL) simulations, shows that the entire tag circuitry occupies roughly 800 gates, well below the 2 000‑gate ceiling. Power consumption stays in the tens of microwatts range, and the end‑to‑end authentication latency is on the order of 2–3 µs, satisfying real‑time requirements for inventory and logistics systems. The ownership‑transfer phase does not introduce additional hardware; it reuses the same PUF‑LFSR block, thereby preserving the low‑cost profile.

In conclusion, the proposed PUF‑LFSR based mutual authentication and ownership‑transfer protocol delivers strong security guarantees for ultra‑low‑cost RFID tags while respecting stringent hardware and energy constraints. The authors suggest future work on robust temperature/voltage compensation for PUFs, scaling the scheme to support batch authentication of many tags simultaneously, and large‑scale silicon validation to confirm reliability across manufacturing variations.