The MD4 Algorithm: Randomizing Nonrandom Bits,
Abstract
In theory, it is difficult to define a hash function which is capable of creating random data from nonrandom data. This paper addresses the randomization properties of an extremely fast, compact hash function. The MD4 message digest algorithm produces a 128-bit output or message digest from an arbitrarily-long input string of bits. The results of a variety if empirical tests which were conducted to detect possible statistical defects in the algorithm are presented.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1992
- Accession Number
- ADP007109
Entities
People
- Mark J. Kiemele
- Philip L. Mayfield
Organizations
- United States Air Force Academy