Presentation 1993/5/14
Breaking the Kobayashi-Fujinami-Tamura Linear Cryptosystem
Hideo Shimizu, Akira Hayashi,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We present a method for breaking the Kobayashi-Fujinami-Tamura linear cryptosystem based on the difficulty of factoring integers. Our polynomial time algorithm has proven to be so effective that it produces the original plaintext for almost all ciphertexts.The lattice basis reduction algorithm by Lenstra,Lenstra and Lovasz is a main tool for the proposed method.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) cryptography / public-key cryptosystem / cryptanalysis / LLL algorithm
Paper # ISEC93-4
Date of Issue

Conference Information
Committee ISEC
Conference Date 1993/5/14(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 Kobayashi-Fujinami-Tamura Linear Cryptosystem
Sub Title (in English)
Keyword(1) cryptography
Keyword(2) public-key cryptosystem
Keyword(3) cryptanalysis
Keyword(4) LLL algorithm
1st Author's Name Hideo Shimizu
1st Author's Affiliation Department of Information and Computer Engineering,Kanazawa Institute of Technology()
2nd Author's Name Akira Hayashi
2nd Author's Affiliation Department of Information and Computer Engineering,Kanazawa Institute of Technology
Date 1993/5/14
Paper # ISEC93-4
Volume (vol) vol.93
Number (no) 24
Page pp.pp.-
#Pages 6
Date of Issue