Skip to main content

All Questions

0 votes
1 answer
381 views

Mathematics of the birthday attack

Let $X, Y$ be finite sets with $|Y|= n$ and $f: X \to Y$ such that all preimages $f^{-1}(y),\,y\in Y$ have the same cardinality. A pair $x_1 \neq x_2$ in $X$ such that $f(x_1)=f(x_2)$ is called a ...
user120513's user avatar
8 votes
2 answers
2k views

Birthday paradox for non-uniform distributions

The classic birthday paradox considers all $n$ possible choices to be equally likely (i.e. every day is chosen with probability $1/n$) and once $\Omega(\sqrt{n})$ days are chosen, the probability of $...
somebody's user avatar
  • 1,095
9 votes
2 answers
1k views

An extension of the birthday problem

Th birthday problem (or paradox) has been done in many way, with around a dozen thread only on math.stackexchange. The way it is expressed is usually the following: "Let us take $n$ people "...
D. Thomine's user avatar