The MD4 Algorithm: Randomizing Nonrandom Bits,

reportActive / Technical Report | Accession Number: ADP007109 | Need Help?

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.

Author(s):
Kiemele, Mark J. ; Mayfield, Philip L.
Author Organization(s):
AIR FORCE ACADEMY COLORADO SPRINGS CO
Supplementary Note:
This article is from 'Computing Science and Statistics: Proceedings of the Symposium on the Interface Critical Applications of Scientific Computing: Biology, Engineering, Medicine, Speech Held in Seattle, Washington on 21-24 April 1991,' AD-A252 938, p70-73.
Pagination:
0004

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
*RANDOM VARIABLES, *ALGORITHMS, *BYTE FUNCTIONAL MODULES, *STATISTICAL ANALYSIS, ALGORITHMS, FUNCTIONS, INPUT, OUTPUT, TEST AND EVALUATION, THEORY
Field(s)/Group(s):
Statistics and Probability
Keyword(s):
Component Reports
Report Date:
1992 Jan 01