35 ms·
People do that. I've done it myself. But all the math about SHA's security properties is about absence of collisions in the full result, not about relative freq
by Arnt 10y ago
People do that. I've done it myself. But all the math about SHA's security properties is about absence of collisions in the full result, not about relative frequency in a small part of the result.
Maybe SHA-8 works fine. I don't know. I've never seen any real mathematical investigation of that, and that's the point.
- eternalban 10y agoIsn't a secure hash supposed to have bit independence?
- dchest 10y agoA secure cryptographic hash function's collision resistance should be MIN(output_length/2, claimed_security). For example, SHA-256 collision security is 128 bits with 256-bit output, but if you truncate output to 128 bits, collision resistance will be 64 bits.