From 12060df9f17a48cd4c7fda27a0af70c17c308ad9 Mon Sep 17 00:00:00 2001 From: Ryan Lortie Date: Wed, 25 Jan 2012 10:09:09 -0500 Subject: [PATCH] GHash: add note about randomness in hashing To clarify our statements about being robust against outside attackers degrading the performance of your hashtable. --- glib/ghash.c | 5 +++++ 1 file changed, 5 insertions(+) diff --git a/glib/ghash.c b/glib/ghash.c index 92c16c9..b058d17 100644 --- a/glib/ghash.c +++ b/glib/ghash.c @@ -165,6 +165,11 @@ * Using g_str_hash() in that situation might make your application * vulerable to Algorithmic Complexity Attacks. * + * 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 */ -- 2.7.4