e/Pearson hashing

Information
has gloss	eng: Pearson hashing is a hash function designed for fast execution on processors with 8-bit registers. Given an input consisting of any number of bytes, it produces as output a single byte that is strongly dependent on every byte of the input. Its implementation requires only a few instructions, plus a 256-byte lookup table containing a permutation of the values 0 through 255.
lexicalization	eng: Pearson hashing
instance of	c/Hash functions