Birthday paradox for multi-collisions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4296 LNCS, Issue , 2006, Pages 29-40

  Suzuki, Kazuhiro ^a   Tonien, Dongvu ^b   Kurosawa, Kaoru ^a   Toyota, Koji ^a  

^a IBARAKI UNIVERSITY   (Japan)

^b UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

Birthday paradox; Collision resistant; Hash function; Multi collision

Indexed keywords

COMPUTATION THEORY; FUNCTIONS;

BIRTHDAY PARADOX; COLLISION RESISTANT; HASH FUNCTION; MULTI-COLLISION;

PROBABILITY;

EID: 34547442579     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/11927587_5     Document Type: Conference Paper

References (6)

1. M.Bellare, J.Kilian and P.Rogaway: The Security of the Cipher Block Chaining Message Authentication Code. J. Comput. Syst. Sci. 61(3): pp.362-399 (2000)
2. M.Bellare and T.Kohno: Hash Function Balance and its Impact on Birthday Attacks. EUROCRYPT 2004, pp.401-418 (2004)
3. E.Brickell, D.Pointcheval, S.Vaudenay and M.Yung: Design Validations for Discrete Logarithm Based Signature Schemes. Public Key Cryptography 2000: pp.276-292 (2000)
4. M.Girault and J.Stern: On the Length of Cryptographic Hash-Values Used in Identification Schemes. CRYPTO 1994: pp.202-215 (1994)
5. Antoine Joux: Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions. CRYPTO 2004: 306-316 (2004)
6. R.Rivest and A.Shamir: PayWord and MicroMint: Two Simple Micropayment Schemes. Security Protocols Workshop 1996: pp.69-87 (1996)