arXiv Open Access 2010

The universality of iterated hashing over variable-length strings

Daniel Lemire

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DB cs.DS

Penulis (1)

Daniel Lemire

Format Sitasi

APA MLA BibTeX

Lemire, D. (2010). The universality of iterated hashing over variable-length strings. https://arxiv.org/abs/1008.1715

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2010
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓