Bernoulli numbers and the probability of a birthday surprise
From MaRDI portal
Publication:1811084
DOI10.1016/S0166-218X(02)00396-7zbMATH Open1022.60006arXivmath/0304028WikidataQ122451902 ScholiaQ122451902MaRDI QIDQ1811084FDOQ1811084
Authors: Boaz Tsaban
Publication date: 10 June 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Abstract: A birthday surprise is the event that, given k uniformly random samples from a sample space of size n, at least two of them are identical. We show that Bernoulli numbers can be used to derive arbitrarily exact bounds on the probability of a birthday surprise. This result can be used in arbitrary precision calculators, and it can be applied to better understand some questions in communication security and pseudorandom number generation.
Full work available at URL: https://arxiv.org/abs/math/0304028
Recommendations
Cites Work
- Title not available (Why is that?)
- The security of the cipher block chaining message authentication code
- Title not available (Why is that?)
- Sums of Powers of Integers
- Guaranteeing the diversity of number generators
- A Quick Route to Sums of Powers
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Bernoulli numbers and the probability of a birthday surprise
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1811084)