A
A
Alexander Shishenko2012-01-09 00:12:30
Hashing
Alexander Shishenko, 2012-01-09 00:12:30

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

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 the question

In order to leave comments, you need to log in

4 answer(s)
F
fossdev, 2012-01-09
@GamePad64

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.

D
darkdimius, 2012-01-09
@darkdimius

look towards CRC

H
homm, 2012-01-09
@homm

xor

Z
zapimir, 2012-01-09
@zapimir

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.

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question