anagram

A word made by rearranging the letters of another word, such as "listen" and "silent".

In more detail

A hash that simply adds up character codes gives every anagram the same value, so an attacker can generate thousands of colliding keys trivially. The course uses anagram keys to show why position must affect a string hash. A polynomial rolling hash avoids this weakness.

Related terms

Taught in

References