Hash function: Difference between revisions

Revision as of 10:04, 27 February 2024

Revision as of 10:16, 17 April 2024

Line 133:

=== Folding ===

A folding hash code is produced by dividing the input into n sections of m bits, where 2^m is the table size, and using a parity-preserving bitwise operation such as ADD or XOR to combine the sections, followed by a mask or shifts to trim off any excess bits at the high or low end. For example, for a table size of 15 bits and key value of 0x0123456789ABCDEF, there are fivefour sections consisting of 0x4DEF, 0x1357, 0x159E, 0x091A and 0x8. Adding, we obtain 0x7AA40x7FFE, a 15-bit value.

=== Mid-squares ===