For Limited Capability Processors … here’s the Pearson Hash
Not every computing device is a high-powered process and needs the security of cryptography hashes. In fact, there are more processors that run with 8-bit or 16-bit registers than are with powerful 32-bit or 64-bit registers. So we sometimes need methods that process with 8-bit registers, and so in 1990, Peter K. Pearson published a classic paper [here]:
His focus was simplifying the creation of a hashed value of an input string:
So basically we had a string (C) with n characters and iterated a hash value (h) by XOR-ing it with the current character. This is an 8-bit operation (and XORs one byte to another). On each iteration we perform a lookup operation for the 256 possible outcomes of this operation. In the paper, this look-up was defined as:
