Presentation 1994/5/20
Breaking the Tanaka-Kobayashi partially super-increasing knapsack cryptosystem
Atsushi Tomioka, Hideo Shimizu, Akira Hayashi,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Tanaka and Kobayashi proposed a new cryptosystem based on the knapsack problem at SCIS 94.The scheme is different from the Merkle-Hellman system in that the underlying knapsack is not of super-increasing type in the strict sense,but is of partially super-increasing type.We will show that the system above can be broken by the lattice basis reduction techniques.The present experimental results prove that the Tanaka-Kobayashi.scheme is insecure,which contradicts their claim.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Knapsack cryptosystem / cryptanalysis / LLL algorithm
Paper # ISEC94-4
Date of Issue

Conference Information
Committee ISEC
Conference Date 1994/5/20(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) Breaking the Tanaka-Kobayashi partially super-increasing knapsack cryptosystem
Sub Title (in English)
Keyword(1) Knapsack cryptosystem
Keyword(2) cryptanalysis
Keyword(3) LLL algorithm
1st Author's Name Atsushi Tomioka
1st Author's Affiliation Kanazawa Institute of Technology()
2nd Author's Name Hideo Shimizu
2nd Author's Affiliation Toshiba
3rd Author's Name Akira Hayashi
3rd Author's Affiliation Kanazawa Institute of Technology
Date 1994/5/20
Paper # ISEC94-4
Volume (vol) vol.94
Number (no) 56
Page pp.pp.-
#Pages 7
Date of Issue