diff options
author | antirez <antirez@gmail.com> | 2017-02-20 16:09:54 +0100 |
---|---|---|
committer | antirez <antirez@gmail.com> | 2017-02-20 17:29:17 +0100 |
commit | adeed29a99dcd0efdbfe4dbd5da74e7b01966c67 (patch) | |
tree | 73feb624357ce5f8bbf82028e75968b67358e3f1 /src/sentinel.c | |
parent | 9b05aafb50348838f45bfddcd689e7d8d1d3c950 (diff) | |
download | redis-adeed29a99dcd0efdbfe4dbd5da74e7b01966c67.tar.gz |
Use SipHash hash function to mitigate HashDos attempts.
This change attempts to switch to an hash function which mitigates
the effects of the HashDoS attack (denial of service attack trying
to force data structures to worst case behavior) while at the same time
providing Redis with an hash function that does not expect the input
data to be word aligned, a condition no longer true now that sds.c
strings have a varialbe length header.
Note that it is possible sometimes that even using an hash function
for which collisions cannot be generated without knowing the seed,
special implementation details or the exposure of the seed in an
indirect way (for example the ability to add elements to a Set and
check the return in which Redis returns them with SMEMBERS) may
make the attacker's life simpler in the process of trying to guess
the correct seed, however the next step would be to switch to a
log(N) data structure when too many items in a single bucket are
detected: this seems like an overkill in the case of Redis.
SPEED REGRESION TESTS:
In order to verify that switching from MurmurHash to SipHash had
no impact on speed, a set of benchmarks involving fast insertion
of 5 million of keys were performed.
The result shows Redis with SipHash in high pipelining conditions
to be about 4% slower compared to using the previous hash function.
However this could partially be related to the fact that the current
implementation does not attempt to hash whole words at a time but
reads single bytes, in order to have an output which is endian-netural
and at the same time working on systems where unaligned memory accesses
are a problem.
Further X86 specific optimizations should be tested, the function
may easily get at the same level of MurMurHash2 if a few optimizations
are performed.
Diffstat (limited to 'src/sentinel.c')
-rw-r--r-- | src/sentinel.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/sentinel.c b/src/sentinel.c index 1f47dd337..6c6a3a0cd 100644 --- a/src/sentinel.c +++ b/src/sentinel.c @@ -379,7 +379,7 @@ void sentinelSimFailureCrash(void); /* ========================= Dictionary types =============================== */ -unsigned int dictSdsHash(const void *key); +uint64_t dictSdsHash(const void *key); int dictSdsKeyCompare(void *privdata, const void *key1, const void *key2); void releaseSentinelRedisInstance(sentinelRedisInstance *ri); |