The fastest and least resource-intensive algorithm for calculating checksums?

Question

Hashing

Blocks that need to be hashed take no more than 128 kilobytes. It is supposed to be used in a network application to check data integrity.

Answer 1

CRC32-C (it's a variant of crc32 with a polynomial of 0x82F63B78), it's the fastest on newer Intels because the sse4.2 set includes an instruction to support it in hardware. On other processors, it is equal in speed to the usual crc32, i.e. also very fast.

Answer 2

look towards CRC

Answer 3

xor

Answer 4

Here, a lot depends on the implementation of the algorithm, for example, in the hash function built into PHP, the fastest md5 algorithm, and crc32 is almost 2 times slower, and the same adler32 is 4 times slower, although according to the descriptions in the same wiki it should be one of the fastest just adler32.