BLAKE2 (Optional Key? One-Way Hash Functions)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O({1})$ auxiliary? bits

(Generally processes the message in O(1)-sized chunks; parameters into the "compress" function are also technically O(1)-sized)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2012

Reference