Hash function: Difference between revisions

Content deleted Content added
Yes, five sections, but the topmost is zero.
Folding: And note that the key is 64 bits.
Line 133:
 
=== Folding ===
A folding hash code is produced by dividing the input into sections of m bits, where 2<sup>m</sup> 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 a 64-bit key value of 0x0123456789ABCDEF, there are five sections consisting of 0x4DEF, 0x1357, 0x159E, 0x091A, and 0x0. Adding, we obtain 0x7FFE, a 15-bit value.
 
=== Mid-squares ===