The universality of iterated hashing over variable-length strings

DOI10.1016/j.dam.2011.11.009zbMath1237.68079arXiv1008.1715OpenAlexW1717515755WikidataQ56115222 ScholiaQ56115222MaRDI QIDQ412371

Daniel Lemire

Publication date: 4 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1008.1715

zbMATH Keywords

permutationsfinite fieldshashing stringsiterated hashing

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (1)

Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries

Cites Work

• Universal classes of hash functions
• Bucket hashing and its application to fast message authentication
• Universal hashing and authentication codes
• A trade-off between collision probability and key size in universal hashing using polynomials
• On Fast and Provably Secure Message Authentication Based on Universal Hashing
• Universal hashing and k-wise independent random variables via integer arithmetic without primes
• Cuckoo hashing
• Constructing an Ideal Hash Function from Weak Ideal Compression Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The universality of iterated hashing over variable-length strings