>The small hash collision probability of the input data size <1 KB?
>The collision hits are more evenly distributed.
These are relative to CRC32. I actually don’t expect the first attribute because the storage space is limited to 32 bits. But for the second… It seems that it might be improved.
Any ideas? Thank you. (I need a specific implementation, better in C, but C/C++# or anything that starts is also fine).
Is there any 32-bit checksum algorithm:
>The smaller hash collision probability of the input data size <1 KB?
>The collision hits are more evenly distributed.
These are relative to CRC32. I actually don’t expect the first attribute because the storage space is limited to 32 bits. But for the second… It seems that it might be improved.
Any ideas? Thank you. (I need a specific implementation, which is better in C, but C/C++# or anything that starts is also ok).
How about MurmurHash ? It is said, this hash has a good distribution (by chi-square test) and a good avalanche effect. The calculation speed is also very good.