Birthday Paradox for Multi-collisions

DOI10.1007/11927587_5zbMath1272.94064OpenAlexW3159346169WikidataQ64357267 ScholiaQ64357267MaRDI QIDQ5385540

Kaoru Kurosawa, Kazuhiro Suzuki, Dongvu Tonien, Koji Toyota

Publication date: 6 May 2008

Published in: Information Security and Cryptology – ICISC 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11927587_5

zbMATH Keywords

hash functionbirthday paradoxmulti-collisioncollision resistant

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (14)

Provable Chosen-Target-Forced-Midfix Preimage Resistance ⋮ Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption ⋮ Security analysis on an ElGamal-like multivariate encryption scheme based on isomorphism of polynomials ⋮ Cryptanalysis of Round-Reduced $$\mathtt{LED}$$ ⋮ Efficient leakage-resilient MACs without idealized assumptions ⋮ Fully homomorphic SIMD operations ⋮ Testing Data Binnings ⋮ Quantum algorithm for the multicollision problem ⋮ Anonymity and k-Choice Identities ⋮ Inside the Hypercube ⋮ Cryptanalysis of Vortex ⋮ Beyond conventional security in sponge-based authenticated encryption modes ⋮ Faster Multicollisions ⋮ Topics and Techniques in Distribution Testing: A Biased but Representative Sample

This page was built for publication: Birthday Paradox for Multi-collisions