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
Fungsi cincang yang paling banyak digunakan daripada keluarga MD4 telah dipecahkan, yang membawa kepada persaingan awam untuk mereka bentuk fungsi cincang baharu yang dipegang oleh NIST. Kertas kerja ini memfokuskan kepada satu konsep yang dipanggil rintangan hampir perlanggaran: secara pengiraan sukar untuk mencari sepasang mesej dengan nilai cincang yang berbeza dalam hanya beberapa bit, yang mana fungsi cincang baharu harus dipenuhi. Dalam kertas kerja ini, kami akan memberikan model hampir perlanggaran pada MD4, dan menggunakannya untuk menyerang protokol termasuk HMAC/NMAC-MD4 dan MD4(Kata Laluan||Cabaran). Serangan pemulihan kunci luar baharu kami pada HMAC/NMAC-MD4 mempunyai kerumitan 272 pertanyaan dalam talian dan 277 Pengiraan MD4, manakala keputusan sebelumnya ialah 288 pertanyaan dalam talian dan 295 Pengiraan MD4. Serangan kami pada MD4(Kata Laluan||Cabaran) boleh memulihkan 16 aksara kata laluan dengan kerumitan 237 pertanyaan dalam talian dan 221 Pengiraan MD4, yang merupakan pendekatan pertama untuk menyerang protokol tersebut.
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.
Salinan
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
Salinan
@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},}
Salinan
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 -