On: Lifetimes of cryptographic hash functions

[kobeya]

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.

[koolba → kobeya]

If you're using SHA-anything for hashing passwords you're doing it wrong.

[kobeya → koolba]

Industry standards like PBKDF2 use hash functions like SHA internally.