NIST · ИТ · fc09599ce91517e6462e
Second Primages on n-bit Hash Functions for Much Less than 2n Work
We expand a previous result of Dean[Dea99] to provide a second preimage attack on all n-bit iterated hash functions with Damgard-Merkle strengthening and n-bit intermediate states, allowing a second preimage to be found for a 2k-message-block message with
NIST · ИТОфициальный источник · 2005-05-01
{
"title_en": "Second Primages on n-bit Hash Functions for Much Less than 2n Work",
"designation": "",
"series": "",
"status": "",
"date": "2005-05-01",
"date_original": "May 1, 2005",
"url": "https://www.nist.gov/publications/second-primages-n-bit-hash-functions-much-less-2n-work",
"source": "NIST Publications",
"display_en": "",
"authors_en": "John M. Kelsey , B Schneier",
"abstract_excerpt_en": "We expand a previous result of Dean[Dea99] to provide a second preimage attack on all n-bit iterated hash functions with Damgard-Merkle strengthening and n-bit intermediate states, allowing a second preimage to be found for a 2k-message-block message with",
"id": "fc09599ce91517e6462e",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "Second Primages on n-bit Hash Functions for Much Less than 2n Work",
"designation": "",
"series": "",
"status": "",
"date": "2005-05-01",
"date_original": "May 1, 2005",
"url": "https://www.nist.gov/publications/second-primages-n-bit-hash-functions-much-less-2n-work",
"source": "NIST Publications",
"display_en": "",
"authors_en": "John M. Kelsey , B Schneier",
"abstract_excerpt_en": "We expand a previous result of Dean[Dea99] to provide a second preimage attack on all n-bit iterated hash functions with Damgard-Merkle strengthening and n-bit intermediate states, allowing a second preimage to be found for a 2k-message-block message with"
}
],
"translation_state": "none"
}