On the hardware design and implementation of a chaos-based RFID authentication and watermarking scheme
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
In this paper, we identify key factors that are specific to a successful hardware implementation which uses chaos in RFID communications under the ISO14443A standard, and highlight some of the challenges that have to be overcome for such an implementation. We propose a brand new RFID authentication scheme based on Lorenz chaotic system and a watermarking scheme utilizing the continuously changing and random Lorenz chaotic states to conceal plaintext transmissions between the reader and the tag. This novel way of combining the resources used for authentication and obfuscation of plaintext data significantly reduces the complexity and memory requirements of modern tags, in addition to securing not just the authentication phase of an RFID communication session, but all communication between a reader and a tag. We also provide the details of our proposed authentication and watermarking scheme in hardware while providing supporting justifications for the correctness of our implementation.
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.000 | 0.000 |
| 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.000 |
| Open science | 0.000 | 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