SHA-1 (Unkeyed Hash Functions One-Way Hash Functions)

From Algorithm Wiki

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

1993

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=SHA-1_(Unkeyed_Hash_Functions_One-Way_Hash_Functions)&oldid=45558"