SHA-2 (Unkeyed Hash Functions One-Way Hash Functions)
Jump to navigation
Jump to search
Time Complexity
$O(n)$
Space Complexity
$O({1})$ auxiliary? bits
(Based off of Merkel-Damgard construction (see MD5))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2001