Presentation 2007-05-18
Birthday Paradox for Multi-Collisions
Kazuhiro SUZUKI, Dongvu TONIEN, Kaoru KUROSAWA, Koji TOYOTA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we study multi-collision probability. For a hash function H:D→R with |R|= n, it has been believed that we can find an s-collision by hashing Q = n^<(s-1)/s>times. We first show that this probability is at most 1/s! which is very small for large s. We next show that by hashing (s!)^<1/s>×Q times, an s-collision is found with probability approximately 0.5 for sufficiently large n. Note that if s = 2, it coincides with the usual birthday paradox. Hence it is a generalization of the birthday paradox to multi-collisions.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) hash function / birthday paradox / multi-collision / collision resistant
Paper # ISEC2007-6
Date of Issue

Conference Information
Committee ISEC
Conference Date 2007/5/11(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Birthday Paradox for Multi-Collisions
Sub Title (in English)
Keyword(1) hash function
Keyword(2) birthday paradox
Keyword(3) multi-collision
Keyword(4) collision resistant
1st Author's Name Kazuhiro SUZUKI
1st Author's Affiliation Venture Business Laboratory, Ibaraki University()
2nd Author's Name Dongvu TONIEN
2nd Author's Affiliation School of Information Technology and Computer Science, University of Wollongong
3rd Author's Name Kaoru KUROSAWA
3rd Author's Affiliation Department of Computer and Information Sciences, Ibaraki University
4th Author's Name Koji TOYOTA
4th Author's Affiliation Department of Computer and Information Sciences, Ibaraki University
Date 2007-05-18
Paper # ISEC2007-6
Volume (vol) vol.107
Number (no) 44
Page pp.pp.-
#Pages 6
Date of Issue