论文信息 - The Collision Rate Tests of Two Known Message Digest Algorithms

The Collision Rate Tests of Two Known Message Digest Algorithms

MD5 and SHA-1 are two known message digest algorithms widely used in the information security. A novice method of evaluating them is proposed here to analyze the collision rate of those two message digests. Computer-simulating technology is a key to this method and used to establish the statistical evaluation model in which data blocks are produced by a random number generator and corrupted by natural scrambling in order to compare the value of message digest for the same data with its corrupted copy, if two message digests collide, they meet at the digest. The results show that 160-bit SHA-1 code is more secure than 128-bit MD5 code and has a fewer collision rate, but SHA-1 executes more slowly than MD5 on the same hardware.

Hu Ming | Wang Yan | Hu Ming | Wang Yan

[1] Atul Kahate. Cryptography and Network Security , 2009 .

[2] 김기천,et al. [서평]「Computer Networks and Internets」 , 1999 .

[3] J. Banks,et al. Discrete-Event System Simulation , 1995 .

[4] William Stallings,et al. Cryptography and Network Security: Principles and Practice , 1998 .

[5] Peter C. Gutmann. Cryptographic Security Architecture: Design and Verification , 2003 .

[6] William Stallings,et al. Cryptography and network security , 1998 .

[7] Douglas E. Comer,et al. Internetworking with TCP/IP - Principles, Protocols, and Architectures, Fourth Edition , 1988 .

[8] Douglas Comer. Internetworking With TCP/IP Principles , 1988 .

[9] Douglas E. Comer. Computer networks and lnternets , 1996 .