Home/ Questions/Q 6906997
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-27T08:22:51+00:00

Are there any 32-bit checksum algorithm with either: Smaller hash collision probability for input

  • 0

Are there any 32-bit checksum algorithm with either:

  • Smaller hash collision probability for input data sizes < 1 KB ?
  • Collision hits with more uniform distribution.

These relative to CRC32. I’m practically not counting on first property, because of limitation of storage space of 32 bits. But for the second … seems there could be improvements.

Any ideas ? Thanks. (I need concrete implementation, better in C, but C++/ C# or anything to start with is also OK).

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    How about MurmurHash? It is said, that this hash has good distribution (passes chi-square tests) and good avalanche effect. Also very good computing speed.

    • 0