3 ms·
https://eprint.iacr.org/2019/078 https://eprint.iacr.org/2019/078 is a good overview of the statistical properties of SHA hashes. Basically after ~10 rounds th
by benlivengood 4y ago
https://eprint.iacr.org/2019/078 https://eprint.iacr.org/2019/078 is a good overview of the statistical properties of SHA hashes.
Basically after ~10 rounds the output is always indistinguishable from randomness which means hamming distance is what you'd expect (about half the bits differ) between the hashes of any two bitstreams.
- dragontamer 4y agoCRC does better than random vs burst errors. And vs random errors is indistinguishable from any other methodology. If you are only worried about random errors, might as well use chksum.