Counting birthday collisions using partitions
arXiv:1906.08671
Abstract
We use partitions to provide some formulae for counting s-collisions and other events in various forms of the Birthday Problem.
arXiv comment11 pages
References in corpus (6)
- A Birthday Paradox for Markov chains with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm
- Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process
- A generalization of the Birthday problem and the chromatic polynomial
- The birthday problem and Markov chain Monte Carlo
- Integral Factorial Ratios
- A New Non-MDS Hash Function Resisting Birthday Attack and Meet-in-the-middle Attack