On the number of divisors of a polynomial over GF(2)
Proceedings of the 2nd international conference, AAECC-2 on Applied algebra, algorithmics and error-correcting codes
Practical performance of Bloom filters and parallel free-text searching
Communications of the ACM
Fast hashing of variable-length text strings
Communications of the ACM
Techniques for automatically correcting words in text
ACM Computing Surveys (CSUR)
Hash functions based on block ciphers: a synthetic approach
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Universal hashing and authentication codes
Designs, Codes and Cryptography
Power comparisons for barrel shifters
ISLPED '96 Proceedings of the 1996 international symposium on Low power electronics and design
Recursive hashing functions for n-grams
ACM Transactions on Information Systems (TOIS)
Even strongly universal hashing is pretty fast
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Fast Universal Hashing with Small Keys and No Preprocessing: The PolyR Construction
ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
LFSR-based Hashing and Authentication
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
On Fast and Provably Secure Message Authentication Based on Universal Hashing
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Dynamic word based text compressio
ICDAR '97 Proceedings of the 4th International Conference on Document Analysis and Recognition
Performance in Practice of String Hashing Functions
Proceedings of the Fifth International Conference on Database Systems for Advanced Applications (DASFAA)
Secrecy, authentication, and public key systems.
Secrecy, authentication, and public key systems.
Tabulation based 4-universal hashing with applications to second moment estimation
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Journal of Algorithms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
String hashing for linear probing
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
New hash functions for message authentication
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Constructing an ideal hash function from weak ideal compression functions
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
Recursive n-gram hashing is pairwise independent, at best
Computer Speech and Language
A trade-off between collision probability and key size in universal hashing using polynomials
Designs, Codes and Cryptography
| Hi-index | 0.04 |
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.