Characterizing Padding Rules of MD Hash Functions Preserving Collision Security
This paper characterizes collision preserving padding rules and provides variants of Merkle-Damgaard (MD) which are having less or no overhead costs due to length. We first show that suffix-free property of padding rule is necessary as well as sufficient
{
"title_en": "Characterizing Padding Rules of MD Hash Functions Preserving Collision Security",
"designation": "",
"series": "",
"status": "",
"date": "2009-06-29",
"date_original": "June 29, 2009",
"url": "https://www.nist.gov/publications/characterizing-padding-rules-md-hash-functions-preserving-collision-security",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Mridul Nandi",
"abstract_excerpt_en": "This paper characterizes collision preserving padding rules and provides variants of Merkle-Damgaard (MD) which are having less or no overhead costs due to length. We first show that suffix-free property of padding rule is necessary as well as sufficient",
"id": "c2c8a421938fc48a72f9",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "Characterizing Padding Rules of MD Hash Functions Preserving Collision Security",
"designation": "",
"series": "",
"status": "",
"date": "2009-06-29",
"date_original": "June 29, 2009",
"url": "https://www.nist.gov/publications/characterizing-padding-rules-md-hash-functions-preserving-collision-security",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Mridul Nandi",
"abstract_excerpt_en": "This paper characterizes collision preserving padding rules and provides variants of Merkle-Damgaard (MD) which are having less or no overhead costs due to length. We first show that suffix-free property of padding rule is necessary as well as sufficient"
}
],
"translation_state": "none",
"possible_title_matches": 1
}