<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>Year-2010</title>
<link href="http://repository.iiitd.edu.in/xmlui/handle/123456789/7" rel="alternate"/>
<subtitle/>
<id>http://repository.iiitd.edu.in/xmlui/handle/123456789/7</id>
<updated>2026-04-11T06:33:54Z</updated>
<dc:date>2026-04-11T06:33:54Z</dc:date>
<entry>
<title>Attacking the tav-128 hash function</title>
<link href="http://repository.iiitd.edu.in/xmlui/handle/123456789/14" rel="alternate"/>
<author>
<name>Kumar, Ashish</name>
</author>
<author>
<name>Sanadhya, Somitra Kumar</name>
</author>
<id>http://repository.iiitd.edu.in/xmlui/handle/123456789/14</id>
<updated>2017-07-24T17:14:47Z</updated>
<published>2012-03-14T09:53:24Z</published>
<summary type="text">Attacking the tav-128 hash function
Kumar, Ashish; Sanadhya, Somitra Kumar
Many RFID protocols use cryptographic hash functions for&#13;
their security. The resource constrained nature of RFID systems forces&#13;
the use of light weight cryptographic algorithms. Tav-128 is one such&#13;
light weight hash function proposed by Peris-Lopez et al. for an RFID&#13;
authentication protocol. In this article we show that Tav-128 is not collision&#13;
resistant. We show a practical collision attack against Tav-128 and&#13;
produce message pairs of arbitrary length which produce the same hash&#13;
value under this hash function. We also study the constituent functions&#13;
of Tav-128 and show that the concatenation of nonlinear functions A and&#13;
B produces a 64-bit permutation from 32-bit messages. This could be a&#13;
useful light weight primitive for future RFID protocols.
</summary>
<dc:date>2012-03-14T09:53:24Z</dc:date>
</entry>
</feed>
