6d4ddbc5137ff6022d91 · Collisions and Near-Collisions for Reduced-Round Tiger
Collisions and Near-Collisions for Reduced-Round Tiger
We describe a collision-finding attack on 16 rounds of the Tiger hash function requiring the time for about 244 compression function invocations. This extends to a collision-finding attack on 17 rounds of the Tiger hash function in time of about 249
{
"title_en": "Collisions and Near-Collisions for Reduced-Round Tiger",
"designation": "",
"series": "",
"status": "",
"date": "2006-03-01",
"date_original": "March 1, 2006",
"url": "https://www.nist.gov/publications/collisions-and-near-collisions-reduced-round-tiger",
"source": "NIST Publications",
"display_en": "",
"authors_en": "John M. Kelsey , Stefan Lucks",
"abstract_excerpt_en": "We describe a collision-finding attack on 16 rounds of the Tiger hash function requiring the time for about 244 compression function invocations. This extends to a collision-finding attack on 17 rounds of the Tiger hash function in time of about 249",
"id": "6d4ddbc5137ff6022d91",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "Collisions and Near-Collisions for Reduced-Round Tiger",
"designation": "",
"series": "",
"status": "",
"date": "2006-03-01",
"date_original": "March 1, 2006",
"url": "https://www.nist.gov/publications/collisions-and-near-collisions-reduced-round-tiger",
"source": "NIST Publications",
"display_en": "",
"authors_en": "John M. Kelsey , Stefan Lucks",
"abstract_excerpt_en": "We describe a collision-finding attack on 16 rounds of the Tiger hash function requiring the time for about 244 compression function invocations. This extends to a collision-finding attack on 17 rounds of the Tiger hash function in time of about 249"
}
],
"translation_state": "none"
}