MD5 (Unkeyed Hash Functions One-Way Hash Functions)
Jump to navigation
Jump to search
Time Complexity
$O(n)$
Space Complexity
$O({1})$ auxiliary? bits
(only need constant padding, 128-bit state being manipulated, and constant-sized non-linear functions (i.e. operating on O(1) bits). Also based off of Merkle-Damgard construction)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1991