BLAKE2 (Optional Key? One-Way Hash Functions)
Revision as of 12:17, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 ==")
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