INDOCRYPT 2009, 10th International Conference on Cryptology, December 13-16, 2009, New Delhi, India / Also published as Springer "Lecture Notes in Computer Science", Vol 5922/2009, ISBN: 978-3-642-10627-9
This paper investigates a new family of RFID protocols called F f that grew out of a proposal made at ESORICS 2007. This family has the property of having highly efficient implementations and simultaneously providing some security arguments which shares some features with the HB protocol family. In this work, we exhibit links between the F f protocol and the LPN problem, and demonstrate two attacks against the F f family of protocols which run with a time complexity of about 252 and 238 respectively against the instance proposed by the designers that has a 512-bit secret key. Our two attacks have the nice property that they only require interactions with the tag alone and does not involve the reader.
This work has been supported in part by the French Government through the ANR project RFID-AP.
Type:
Conférence
City:
New Delhi
Date:
2009-12-13
Department:
Sécurité numérique
Eurecom Ref:
2912
Copyright:
© Springer. Personal use of this material is permitted. The definitive version of this paper was published in INDOCRYPT 2009, 10th International Conference on Cryptology, December 13-16, 2009, New Delhi, India / Also published as Springer "Lecture Notes in Computer Science", Vol 5922/2009, ISBN: 978-3-642-10627-9
and is available at : http://dx.doi.org/10.1007/978-3-642-10628-6_21
and is available at : http://dx.doi.org/10.1007/978-3-642-10628-6_21
See also:
