Lightweight mutual authentication protocol for resource-constrained radio frequency identification tags with PRINCE cipher
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
<span>Radio frequency identification (RFID) is a key technology for the internet of things (IoT), with widespread applications in the commercial, healthcare, enterprise, and community sectors. However, privacy and security concerns remain with RFID systems. This manuscript presents a novel RFID-based mutual authentication protocol (MAP) using the PRINCE cipher to address these concerns. The proposed MAP leverages a PRINCE cipher architecture capable of both encryption and decryption based on a mode signal. It performs five encryption and two decryption processes during tag and reader mutual authentication, with updated seed values ensuring synchronization and secure data communication. The PRINCE cipher implementation utilizes less than 1% of slices, operates at 226 MHz with a latency of 3.5 clock cycles (CC), and has a throughput of 4.125 Gbps. The complete RFID-based MAP consumes 721 mW of power, occupies 2% of the chip area, and achieves a latency of 35.5 CC and a throughput of 262 Mbps. This represents a 25% reduction in latency, a 40% increase in throughput, and a 30% decrease in execution time compared to existing MAP approaches. The findings demonstrate the potential of the proposed MAP to enhance latency, throughput, and execution time, offering a promising solution for secure and efficient RFID authentication.</span>
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it