Pearson hashing

<h2 id="example-implementations">Example implementations</h2>
<h3><a href="/facts/C_Sharp_(programming_language)/UC2gxeyb">C#</a>, 8-bit</h3>
public class PearsonHashing
{
    public static byte Hash(string input)
    {
        byte[] T = { /* Permutation of 0-255 */ };
        
        byte hash = 0;
        byte[] bytes = Encoding.UTF8.GetBytes(input);

foreach (byte b in bytes)
        {
            hash = T[hash ^ b];
        }

return hash;
    }
}

<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Non-cryptographic_hash_functions/fdTqDa9l">Non-cryptographic hash functions</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Pearson, Peter K. (June 1990), "Fast Hashing of Variable-Length Text Strings" (PDF), Communications of the ACM, 33 (6): 677–680, doi:10.1145/78973.78978, archived from the original (PDF) on 2012-07-04, retrieved 2013-07-13 <a href="https://web.archive.org/web/20120704025921/http://cs.mwsu.edu/~griffin/courses/2133/downloads/Spring11/p677-pearson.pdf" target="_blank">https://web.archive.org/web/20120704025921/http://cs.mwsu.edu/~griffin/courses/2133/downloads/Spring11/p677-pearson.pdf</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>Lemire, Daniel (2012), "The universality of iterated hashing over variable-length strings", Discrete Applied Mathematics, 160 (4–5): 604–617, arXiv:1008.1715, doi:10.1016/j.dam.2011.11.009 <a href="/wiki/Discrete_Applied_Mathematics" target="_blank">/wiki/Discrete_Applied_Mathematics</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
</ol>

Pearson hashing open-in-new

Pearson hashing