해쉬 함수의 근사적 모델과 연쇄패턴 = Approximated Model and Chaining Pattern of Hash Functions

다국어 초록 (Multilingual Abstract)

The evaluation of MDx family hash functions such as MD5 is difficult because the design background or a generalized model is unknown. In this paper, an approximated model is proposed to generalize hash functions. The diffusion of a input difference is tested by an approximated model for MD5. The results show that MD5 does not provide perfect diffusion, so MD5 is weak against some attacks. We propose a multiple chaining pattern which provides perfect diffusion in approximated model of hash function without extra calculation or memory. And We show the probability of differential characteristics of our proposal.

참고문헌 (Reference)

1 H. Dobbertin, "The status of MD5 after recent attack" 2 (2): 1-6, 1996

2 R.Rivest, "The MD5 message- digest algo rithm" 1992

3 R.Rivest, "The MD4 message- digest algorithm" 1992

4 NIST, "Secure hash standard, FIPS 180-1" US Department of Commerce, Washington D.C. 1993

5 H.Dobbertin, "RIPEMD- 160:A strengthened version of RIPEMD" Springer-Verlag 71-82, 1996

6 S.Vaudenay, "On the need for multipermutations:cryptalaysis of MD4 and SAFER : Fast Software Encryption, Lecture Notes in Computer Science" Springer-Verlag 286-29, 1995

7 X.Y.Wang, "How to break MD5 and other hash functions : advances in Cryptology-Eurocrypt'05" Springer-Verlag 19-35, 2005

8 H.Dobbertin, "Cryptanalysis of MD4", Fast Software Encryption, Lecture Notes in Computer Science 1039" Springer-Verlag 53-69, 1996

9 B.den Boer, "An attack on the last two round of MD4" Springer-Verlag 194-203, 1991