Presentation 2016-05-19
[Invited Talk] Refinements of the k-tree Algorithm for the Generalized Birthday Problem
Yu Sasaki,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this invited talk, we introduce the lecture with the same title presented at the international cryptographic conference ASIACRYPT 2015held on November 29th - December 3rd, 2015 at Auckland, New Zealand.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) $k$-tree / generalized birthday problem / multicollision / Hellman's table
Paper # ISEC2016-12
Date of Issue 2016-05-12 (ISEC)

Conference Information
Committee ISEC
Conference Date 2016/5/19(1days)
Place (in Japanese) (See Japanese page)
Place (in English) Kikai-Shinko-Kaikan Bldg.
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair Yukiyasu Tsunoo(NEC)
Vice Chair Masahiro Mambo(Kanazawa Univ.) / Kazuto Ogawa(NHK)
Secretary Masahiro Mambo(AIST) / Kazuto Ogawa(Toshiba)
Assistant Tetsuya Izu(Fujitsu Lab.) / Takaaki Mizuki(Tohoku Univ.) / Noritaka Yamashita(NEC)

Paper Information
Registration To Technical Committee on Information Security
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) [Invited Talk] Refinements of the k-tree Algorithm for the Generalized Birthday Problem
Sub Title (in English)
Keyword(1) $k$-tree
Keyword(2) generalized birthday problem
Keyword(3) multicollision
Keyword(4) Hellman's table
1st Author's Name Yu Sasaki
1st Author's Affiliation Nippon Telegraph and Telephone Corporation(NTT)
Date 2016-05-19
Paper # ISEC2016-12
Volume (vol) vol.116
Number (no) ISEC-35
Page pp.pp.49-49(ISEC),
#Pages 1
Date of Issue 2016-05-12 (ISEC)