Birthday Paradox for Multi-collisions
From MaRDI portal
Recommendations
- The Kolmogorov birthday paradox
- Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process
- The Birthday Problem Revisited
- Birthday Problem with Unlike Probabilities
- The generalized birthday problem
- scientific article; zbMATH DE number 1942427
Cited in
(22)- Collision probability between sets of random variables.
- Quantum algorithm for the multicollision problem
- Security analysis on an ElGamal-like multivariate encryption scheme based on isomorphism of polynomials
- Beyond conventional security in sponge-based authenticated encryption modes
- Fully homomorphic SIMD operations
- Refining the asymptotic approximation of the group size in the birthday paradox
- Provable chosen-target-forced-midfix preimage resistance
- Cryptanalysis of Round-Reduced $$\mathtt{LED}$$
- Anonymity and k-Choice Identities
- Inside the Hypercube
- Cryptanalysis of Vortex
- Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption
- The combinatorics of the colliding bullets
- Multi party computation motivated by the birthday problem
- Advances in Cryptology - EUROCRYPT 2004
- Faster Multicollisions
- Topics and Techniques in Distribution Testing: A Biased but Representative Sample
- Testing Data Binnings
- Efficient leakage-resilient MACs without idealized assumptions
- A note on the exponentiation approximation of the birthday paradox
- A groupwise approach to the birthday paradox
- Revisiting OKVS-based OPRF and PSI: cryptanalysis and better construction
This page was built for publication: Birthday Paradox for Multi-collisions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385540)
