Tagged Questions
1
vote
1answer
73 views
Bit permutations and collisions of compression function
I'm having trouble finding a good method for solving the following problem:
If $n$ is a positive integer, let $S_n$ denote the group of permutations of the set $\{1,2,\dots, n\}$. For a permutation ...
2
votes
2answers
154 views
Universal Hashing
to my current understanding Universal Hashing is a method whereby the hash function is chosen randomly at runtime in order to guarantee reasonable performance for any kind of input.
I understand we ...
13
votes
3answers
364 views
Curious Properties of 33
Because my explanation has so many words, I'll start with my question and then you can read the explanation if you need to:
The Bernstein Hash method uses the number 33 as a multiplier. From what ...
