 Its implementation requires only a few instructions, plus a 256-byte lookup table containing a permutation of the values 0 through 255.This hash function is a CBC-MAC that uses an 8-bit substitution cipher implemented via the substitution table.An 8-bit cipher has negligible cryptographic security, so the Pearson hash function is not cryptographically strong, but it is useful for implementing hash tables or as a data integrity check code, for which purposes it offers these benefits