Re:Lifetimes of cryptographic hash functions
by kobeya on Sunday February 26, 2017 @12:54AM
(#13735903)
For hashing large data, yes. For password derivation schemes or hash trees, no. SHA512 is only faster per byte because the block size is larger. SHA256 has faster rounds.
[ Parent
| on HN ]