Please use this identifier to cite or link to this item:
http://repository.iiitd.edu.in/xmlui/handle/123456789/14Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kumar, Ashish | - |
| dc.contributor.author | Sanadhya, Somitra Kumar | - |
| dc.date.accessioned | 2012-03-14T09:53:24Z | - |
| dc.date.available | 2012-03-14T09:53:24Z | - |
| dc.date.issued | 2012-03-14T09:53:24Z | - |
| dc.identifier.uri | https://repository.iiitd.edu.in/jspui/handle/123456789/14 | - |
| dc.description.abstract | Many RFID protocols use cryptographic hash functions for their security. The resource constrained nature of RFID systems forces the use of light weight cryptographic algorithms. Tav-128 is one such light weight hash function proposed by Peris-Lopez et al. for an RFID authentication protocol. In this article we show that Tav-128 is not collision resistant. We show a practical collision attack against Tav-128 and produce message pairs of arbitrary length which produce the same hash value under this hash function. We also study the constituent functions of Tav-128 and show that the concatenation of nonlinear functions A and B produces a 64-bit permutation from 32-bit messages. This could be a useful light weight primitive for future RFID protocols. | en_US |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | IIITD-TR-2010-001 | - |
| dc.subject | Hash function | en_US |
| dc.subject | Tav-128 | en_US |
| dc.subject | Cryptanalysis | en_US |
| dc.title | Attacking the tav-128 hash function | en_US |
| dc.type | Technical Report | en_US |
| Appears in Collections: | Year-2010 | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| IIITD-TR-2010-001.pdf | 143.3 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.