Reducing Time Complexity in RFID Systems

DOI10.1007/11693383_20zbMath1151.94475OpenAlexW1930460466MaRDI QIDQ5426198

Philippe Oechslin, Etienne Dysli, Gildas Avoine

Publication date: 15 November 2007

Published in: Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11693383_20

zbMATH Keywords

time complexityRFIDtime-memory trade-off

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Flowgraph models for estimating total time of authentication process in RFID system ⋮ Comments on enhanced yoking proof protocols for radio frequency identification tags and tag groups ⋮ On Privacy Models for RFID ⋮ A Highly Scalable RFID Authentication Protocol ⋮ Addressing Flaws in RFID Authentication Protocols ⋮ Vulnerability aware graphs for RFID protocol security benchmarking

This page was built for publication: Reducing Time Complexity in RFID Systems