<?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>DSpace Collection:</title>
  <link rel="alternate" href="http://repository.iiitd.edu.in/xmlui/handle/123456789/7" />
  <subtitle />
  <id>http://repository.iiitd.edu.in/xmlui/handle/123456789/7</id>
  <updated>2026-06-20T07:45:46Z</updated>
  <dc:date>2026-06-20T07:45:46Z</dc:date>
  <entry>
    <title>Attacking the tav-128 hash function</title>
    <link rel="alternate" href="http://repository.iiitd.edu.in/xmlui/handle/123456789/14" />
    <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">Title: Attacking the tav-128 hash function
Authors: Kumar, Ashish; Sanadhya, Somitra Kumar
Abstract: Many RFID protocols use cryptographic hash functions for&#xD;
their security. The resource constrained nature of RFID systems forces&#xD;
the use of light weight cryptographic algorithms. Tav-128 is one such&#xD;
light weight hash function proposed by Peris-Lopez et al. for an RFID&#xD;
authentication protocol. In this article we show that Tav-128 is not collision&#xD;
resistant. We show a practical collision attack against Tav-128 and&#xD;
produce message pairs of arbitrary length which produce the same hash&#xD;
value under this hash function. We also study the constituent functions&#xD;
of Tav-128 and show that the concatenation of nonlinear functions A and&#xD;
B produces a 64-bit permutation from 32-bit messages. This could be a&#xD;
useful light weight primitive for future RFID protocols.</summary>
    <dc:date>2012-03-14T09:53:24Z</dc:date>
  </entry>
</feed>

