NIST · ИТ · ee21373a3436e7398860
Practical Near-Collisions for Reduced Round Blake, Fugue, Hamsi and JH
A hash function is near-collision resistant, if it is hard to find two messages with hash values that differ in only small number of bits. In this study, we used hill climbing methods to find near-collisions for some of the second round SHA-3 candidates
NIST · ИТОфициальный источник · 2010-08-23
{
"title_en": "Practical Near-Collisions for Reduced Round Blake, Fugue, Hamsi and JH",
"designation": "",
"series": "",
"status": "",
"date": "2010-08-23",
"date_original": "August 23, 2010",
"url": "https://www.nist.gov/publications/practical-near-collisions-reduced-round-blake-fugue-hamsi-and-jh",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Meltem Sonmez Turan , Erdener Uyan",
"abstract_excerpt_en": "A hash function is near-collision resistant, if it is hard to find two messages with hash values that differ in only small number of bits. In this study, we used hill climbing methods to find near-collisions for some of the second round SHA-3 candidates",
"id": "ee21373a3436e7398860",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "Practical Near-Collisions for Reduced Round Blake, Fugue, Hamsi and JH",
"designation": "",
"series": "",
"status": "",
"date": "2010-08-23",
"date_original": "August 23, 2010",
"url": "https://www.nist.gov/publications/practical-near-collisions-reduced-round-blake-fugue-hamsi-and-jh",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Meltem Sonmez Turan , Erdener Uyan",
"abstract_excerpt_en": "A hash function is near-collision resistant, if it is hard to find two messages with hash values that differ in only small number of bits. In this study, we used hill climbing methods to find near-collisions for some of the second round SHA-3 candidates"
}
],
"translation_state": "none",
"possible_title_matches": 1
}