Re: HASH Algorithms



We use Bob Jenkins has for stuff like hash tables.
http://burtleburtle.net/bob/hash/doobs.html

We used ELFHash for a while but it produces a lot of hash collisions.

We use CRC64 in one application as well.

MD5,SHA-xxx, etc are too CPU intensive for our needs and I never
bothered testing any of them.

I'll try and dig up the performance numbers for the ones I tested.



In article <gYNBf.15707$Zj7.10938@xxxxxxxxxxxxxxxxxxxxxxx>,
sjensen8@xxxxxxxxxxxxxxx says...
>
>Greets All
>
>I've been searching for a better HASH algorithm.
>Used to use a simple CRC hash (so the comments said, I'm still learning ;)
>Now using Paul Hsieh's SuperFastHash. Which runs about the same speed but
>with better results with collisions/synonms.
>Are there any open-source HASH functions which are particularly efficient on
>NonStop?
>Or, good websites to search for HASH functions so I can benchmark them?
>
>Hashing variable length strings into a 32-bit unsigned integers.
>
>Thanks much for the help,
>Sean.
>
>

.



Relevant Pages

  • Re: MD5 Hash with single quote = grief in dao.findfirst
    ... won't worry about hash collisions on inserts. ... you could just as easily UCASE the hash value??? ... my checks are case insensitive on both DAO and ADO! ... > It even works on the single quote. ...
    (microsoft.public.access.modulesdaovba)
  • HASH Algorithms
    ... I've been searching for a better HASH algorithm. ... Used to use a simple CRC hash (so the comments said, I'm still learning;) ... good websites to search for HASH functions so I can benchmark them? ...
    (comp.sys.tandem)
  • AdaCore Security Advisory SA-2012-L119-003 Hash collisions in AWS
    ... SA-2012-L119-003 Hash collisions in AWS ... Effective Denial of Service attacks against ...
    (Bugtraq)
  • Re: [Full-disclosure] Flog 1.1.2 Remote Admin Password Disclosure
    ... If your password input routine allows ... For instance, if you use a 64-bit hash, and reasonable-length ... what happens is that you basically ignore the hash collisions - because ... which is likely not even enterable at the keyboard (it ends up being ...
    (Full-Disclosure)
  • Re: how much memory does increasing max rules for IPFW take up?
    ... If there are a lot of raw IP or ICMP flows then that's going to result in hash collisions. ... "Bloomier" filters are probably worth a look -- bloom filters are a class of probabilistic hash which may return a false positive, "bloomier" filters are a refinement which tries to limit the false positives. ...
    (freebsd-stable)