The universality of iterated hashing over variable-length strings

Details The universality of iterated hashing over variable-length strings The universality of iterated hashing over variable-length strings

2010-08-10

arxiv.org/abs/1008.1715v5

Discrete Applied Mathematics 160 (4-5), 604--617 (2012)

Computer Science

Databases

Scientific paper

10.1016/j.dam.2011.11.009

Iterated hash functions process strings recursively, one character at a time. At each iteration, they compute a new hash value from the preceding hash value and the next character. We prove that iterated hashing can be pairwise independent, but never 3-wise independent. We show that it can be almost universal over strings much longer than the number of hash values; we bound the maximal string length given the collision probability.

Affiliated with

Also associated with

No associations

Rating

The universality of iterated hashing over variable-length strings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The universality of iterated hashing over variable-length strings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The universality of iterated hashing over variable-length strings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-583727