The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
MD4 제품군에서 가장 널리 사용되는 해시 함수가 손상되어 NIST에서 개최하는 새로운 해시 함수 설계에 대한 공개 경쟁이 시작되었습니다. 이 문서에서는 다음과 같은 한 가지 개념에 중점을 둡니다. 충돌에 가까운 저항: 새로운 해시 함수가 충족해야 하는 몇 비트만 다른 해시 값을 가진 메시지 쌍을 찾는 것이 계산적으로 어렵습니다. 본 논문에서는 MD4에서 충돌에 가까운 모델을 제공하고 이를 HMAC/NMAC-MD4 및 MD4(Password||Challenge)를 포함한 공격 프로토콜에 적용합니다. HMAC/NMAC-MD4에 대한 새로운 외부 키 복구 공격의 복잡성은 2입니다.72 온라인 쿼리 및 277 MD4 계산, 이전 결과는 288 온라인 쿼리 및 295 MD4 계산. MD4(Password||Challenge)에 대한 공격은 16의 복잡성을 지닌 2개의 비밀번호 문자를 복구할 수 있습니다.37 온라인 쿼리 및 221 MD4 계산은 이러한 프로토콜을 공격하는 첫 번째 접근 방식입니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Lei WANG, Kazuo OHTA, Noboru KUNIHIRO, "Near-Collision Attacks on MD4: Applied to MD4-Based Protocols" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 1, pp. 76-86, January 2009, doi: 10.1587/transfun.E92.A.76.
Abstract: The most widely used hash functions from MD4 family have been broken, which lead to a public competition on designing new hash functions held by NIST. This paper focuses on one concept called near-collision resistance: computationally difficult to find a pair of messages with hash values differing in only few bits, which new hash functions should satisfy. In this paper, we will give a model of near-collisions on MD4, and apply it to attack protocols including HMAC/NMAC-MD4 and MD4(Password||Challenge). Our new outer-key recovery attacks on HMAC/NMAC-MD4 has a complexity of 272 online queries and 277 MD4 computations, while previous result was 288 online queries and 295 MD4 computations. Our attack on MD4(Password||Challenge) can recover 16 password characters with a complexity of 237 online queries and 221 MD4 computations, which is the first approach to attack such protocols.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.76/_p
부
@ARTICLE{e92-a_1_76,
author={Lei WANG, Kazuo OHTA, Noboru KUNIHIRO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Near-Collision Attacks on MD4: Applied to MD4-Based Protocols},
year={2009},
volume={E92-A},
number={1},
pages={76-86},
abstract={The most widely used hash functions from MD4 family have been broken, which lead to a public competition on designing new hash functions held by NIST. This paper focuses on one concept called near-collision resistance: computationally difficult to find a pair of messages with hash values differing in only few bits, which new hash functions should satisfy. In this paper, we will give a model of near-collisions on MD4, and apply it to attack protocols including HMAC/NMAC-MD4 and MD4(Password||Challenge). Our new outer-key recovery attacks on HMAC/NMAC-MD4 has a complexity of 272 online queries and 277 MD4 computations, while previous result was 288 online queries and 295 MD4 computations. Our attack on MD4(Password||Challenge) can recover 16 password characters with a complexity of 237 online queries and 221 MD4 computations, which is the first approach to attack such protocols.},
keywords={},
doi={10.1587/transfun.E92.A.76},
ISSN={1745-1337},
month={January},}
부
TY - JOUR
TI - Near-Collision Attacks on MD4: Applied to MD4-Based Protocols
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 76
EP - 86
AU - Lei WANG
AU - Kazuo OHTA
AU - Noboru KUNIHIRO
PY - 2009
DO - 10.1587/transfun.E92.A.76
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2009
AB - The most widely used hash functions from MD4 family have been broken, which lead to a public competition on designing new hash functions held by NIST. This paper focuses on one concept called near-collision resistance: computationally difficult to find a pair of messages with hash values differing in only few bits, which new hash functions should satisfy. In this paper, we will give a model of near-collisions on MD4, and apply it to attack protocols including HMAC/NMAC-MD4 and MD4(Password||Challenge). Our new outer-key recovery attacks on HMAC/NMAC-MD4 has a complexity of 272 online queries and 277 MD4 computations, while previous result was 288 online queries and 295 MD4 computations. Our attack on MD4(Password||Challenge) can recover 16 password characters with a complexity of 237 online queries and 221 MD4 computations, which is the first approach to attack such protocols.
ER -