Presentation 2002/11/7
Analysis of Hash Function Collision for MicroMint Schemes
Satoshi AOKI, Kazuo OHTA, Junko FUKUSHIMA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Rivest and Shamir proposed MicroMint Scheme whose coins are represented by hash function collisions. When k distinct values have the same hash value, they are called k-way hash collision. For methods to enhance the security of MicroMint, there are the measures that we choose the value of κ more than 2, the large size for hash values, and so on. In this paper, we analyze the complexity to generate hash function collisions, the relation between the number of κ-way hash collision and the number of hash operations, and the properties of implement for srorage cut when the size for hash values is large. This is theory analisis to impliment Mint which generates coins.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) MicroMint Scheme / κ-way hash collision / Method of Storage cut
Paper # ISEC2002-77
Date of Issue

Conference Information
Committee ISEC
Conference Date 2002/11/7(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 JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Analysis of Hash Function Collision for MicroMint Schemes
Sub Title (in English)
Keyword(1) MicroMint Scheme
Keyword(2) κ-way hash collision
Keyword(3) Method of Storage cut
1st Author's Name Satoshi AOKI
1st Author's Affiliation Graduate School of Science & Engineering, Waseda University()
2nd Author's Name Kazuo OHTA
2nd Author's Affiliation Derartment of Information and Communication Engineering, The University of Electro-Communications
3rd Author's Name Junko FUKUSHIMA
3rd Author's Affiliation Derartment of Information and Communication Engineering, The University of Electro-Communications
Date 2002/11/7
Paper # ISEC2002-77
Volume (vol) vol.102
Number (no) 436
Page pp.pp.-
#Pages 6
Date of Issue