Presentation 2007-11-22
Cryptanalysis experiment of OTU2000 using the Lagarias-Odlyzko method
Naoto YAMAGUCHI, Akira HAYASHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Okamoto-Tanaka-Uchiyama proposed a public key cryptosystem in 2000, which we call OTU2000 in this paper. OTU2000 is a knapsack cryptosystem that is claimed to be secure even under the quantumn computation environment. We have done computer experiments to investigate how secure OTU2000 is. The method of attack is of the Lagarias-Odlyzko type, where four different lattice bases are used and the two basis reduction algorithms, LLL and BKZ, are applied. The results show that the success rate of attack is nonzero even in the case of relatively high dimension.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) public key cryptosystem / knapsack cryptosystem / lattice basis reduction / Lagarias-Odlyzko attack
Paper # ISEC2007-102,OIS2007-74
Date of Issue

Conference Information
Committee ISEC
Conference Date 2007/11/15(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) Cryptanalysis experiment of OTU2000 using the Lagarias-Odlyzko method
Sub Title (in English)
Keyword(1) public key cryptosystem
Keyword(2) knapsack cryptosystem
Keyword(3) lattice basis reduction
Keyword(4) Lagarias-Odlyzko attack
1st Author's Name Naoto YAMAGUCHI
1st Author's Affiliation Kanazawa Institute of Technology()
2nd Author's Name Akira HAYASHI
2nd Author's Affiliation Kanazawa Institute of Technology
Date 2007-11-22
Paper # ISEC2007-102,OIS2007-74
Volume (vol) vol.107
Number (no) 346
Page pp.pp.-
#Pages 4
Date of Issue