Volume 31, Issue 1 pp. 9-19
Article

A genetic tango attack against the David–Prasad RFID ultra-lightweight authentication protocol

David F. Barrero

David F. Barrero

Departamento de Automática, Universidad de Alcalá, Spain

Search for more papers by this author
Julio César Hernández-Castro

Julio César Hernández-Castro

School of Computing, University of Portsmouth, UK

Search for more papers by this author
Pedro Peris-Lopez

Pedro Peris-Lopez

Faculty of EEMCS, Security Lab, Delft University of Technology, The Netherlands

Search for more papers by this author
David Camacho

David Camacho

Universidad Autónoma de Madrid, Escuela Politécnica Superior, Spain

Search for more papers by this author
María D. R-Moreno

María D. R-Moreno

Departamento de Automática, Universidad de Alcalá, Spain

Search for more papers by this author
First published: 17 September 2012
Citations: 16

Abstract

Radio frequency identification (RFID) is a powerful technology that enables wireless information storage and control in an economical way. These properties have generated a wide range of applications in different areas. Due to economic and technological constrains, RFID devices are seriously limited, having small or even tiny computational capabilities. This issue is particularly challenging from the security point of view. Security protocols in RFID environments have to deal with strong computational limitations, and classical protocols cannot be used in this context. There have been several attempts to overcome these limitations in the form of new lightweight security protocols designed to be used in very constrained (sometimes called ultra-lightweight) RFID environments. One of these proposals is the David–Prasad ultra-lightweight authentication protocol. This protocol was successfully attacked using a cryptanalysis technique named Tango attack. The capacity of the attack depends on a set of boolean approximations. In this paper, we present an enhanced version of the Tango attack, named Genetic Tango attack, that uses Genetic Programming to design those approximations, easing the generation of automatic cryptanalysis and improving its power compared to a manually designed attack. Experimental results are given to illustrate the effectiveness of this new attack.

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.