Most hash functions used in hash table implementations can be broken faster than by using brute-force techniques (which is feasible for hash functions with 32 bit output, but very expensive for 64 bit functions) by using one of two "tricks": equivalent substrings or a meet-in-the-middle attack.
5ba7d905a60a09b9e51b4bfc83a4c27718fe15666e0535630b7937cc69f6152f