Re: Fast 32-bit Hash

From: Andrew Swallow (am.swallow_at_eatspam.btinternet.com)
Date: 02/17/04 

Date: Tue, 17 Feb 2004 17:22:07 +0000 (UTC)

"John Hadstate" <jh113355@hotmail.com> wrote in message
news:4f8c0b5.0402170740.53524d13@posting.google.com...
[snip]
>
> Aside from the obvious fact that a 32-bit hash is mostly too short for
> a cryptographic hash, does anyone see any obvious attacks or other
> problems?
>

Is this suitable for checking that a block or entire message has
arrived error free? That is as a replacement for a CRC.

Diagnostic software frequently checks software in prom by
running a sum check, unfortunately unprogrammed chips can
produce a false pass by returning all zeros or all ones. Will
this hash detect these errors?

A nice simple algorithm.

Andrew Swallow

Relevant Pages

  • Re: Fast 32-bit Hash
    ... > a cryptographic hash, does anyone see any obvious attacks or other ...
    (sci.crypt)
  • Re: Fast 32-bit Hash
    ... >> arrived error free? ... If we are talking about the probability of collisions, ... might be the probability of two pre-images mapping to the same hash ... (or the same CRC-32), but it's not likely to be the probability of two ...
    (sci.crypt)
  • Re: Hash of hashes?
    ... The key of this anonymous hash is $genotype? ... $snp is a scalar ... alleles (keys of the second anonymous hash). ...
    (perl.beginners)
  • Re: How to implement a Hash Table in C
    ... if you don't do that they need to be provided as queue operations. ... probing completely, or I have. ... hash value h has so far resulted in n collisions in a table of size s, ...
    (comp.lang.c)
  • Re: hashs and symbolic refrences
    ... [snip more of the same] ... To just add another key/value pair (and auto-vivify the hash reference the ... > I found that I was using symbolic references quite by accident, ... The problem is that I am capturing only one tag ...
    (comp.lang.perl.misc)
Quantcast