Refining the asymptotic approximation of the group size in the birthday paradox

DOI10.1007/S10559-010-9228-8MaRDI QIDQ2452835zbMATH OpenOpenAlexWikidataFDO

Authors P. A. Endovitskii

Publication date 5 June 2014

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-010-9228-8

zbMATH Keywords

birthday paradoxasymptotic inequalitiescollision method for hash functionsrandom arrangementStirling formula for gamma functions

Mathematics Subject Classification ID

Combinatorial probability (60C05) Factorials, binomial coefficients, combinatorial functions (05A10)

Recommendations

• scientific article; zbMATH DE number 6122929
• Birthday Paradox for Multi-collisions
• A non-uniform birthday problem with applications to discrete logarithms
• Asymptotic results for the number of Wagner's solutions to a generalised birthday problem
• scientific article; zbMATH DE number 1942427

Cites work

• scientific article; zbMATH DE number 3802533 (Why is no real title available?)
• Estimation of the number of ``good permutations with applications to cryptography
• On estimation of the probability of absence of collisions of some random mappings

Cited in

(4)

• Works of the Kiev school of theoretical cryptography
• The generalized birthday problem
• The asymptotics of group Russian roulette
• Asymptotic results for the number of Wagner's solutions to a generalised birthday problem

This page was built for publication: Refining the asymptotic approximation of the group size in the birthday paradox

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2452835)