GHash: add note about randomness in hashing

To clarify our statements about being robust against outside attackers
degrading the performance of your hashtable.
This commit is contained in:
Ryan Lortie 2012-01-25 10:09:09 -05:00
parent 5286dbb7e1
commit 12060df9f1

View File

@ -165,6 +165,11 @@
* Using g_str_hash() in that situation might make your application
* vulerable to <ulink url="https://lwn.net/Articles/474912/">Algorithmic Complexity Attacks</ulink>.
*
* The key to choosing a good hash is unpredictability. Even
* cryptographic hashes are very easy to find collisions for when the
* remainder is taken modulo a somewhat predictable prime number. There
* must be an element of randomness that an attacker is unable to guess.
*
* Returns: the hash value corresponding to the key
*/