Presentation | 2001/7/18 Traveling Salesmam Cryptosystem Tsutomu ANSAI, Hiroaki MATSUYAMA, Kunikatsu KOBAYASHI, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | We propose a public key cryptosystem using the traveling salesman problem that is a NP complete problem.First, we examine the secret keys used in the traveling salesman cryptosysytem.Next, we investigate the public key generation for the traveling salesman cryptosysytem.Then, we propose the new encryption using the mixed sum and product operations. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | NP complete problem / traveling salesman cryptosystem / knapsack cryptosystem / Shamir algorithm / LLL algorithm |
Paper # | ISEC2001-26 |
Date of Issue |
Conference Information | |
Committee | ISEC |
---|---|
Conference Date | 2001/7/18(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) | Traveling Salesmam Cryptosystem |
Sub Title (in English) | |
Keyword(1) | NP complete problem |
Keyword(2) | traveling salesman cryptosystem |
Keyword(3) | knapsack cryptosystem |
Keyword(4) | Shamir algorithm |
Keyword(5) | LLL algorithm |
1st Author's Name | Tsutomu ANSAI |
1st Author's Affiliation | Faculty of Engineering, Yamagata University() |
2nd Author's Name | Hiroaki MATSUYAMA |
2nd Author's Affiliation | Faculty of Engineering, Yamagata University |
3rd Author's Name | Kunikatsu KOBAYASHI |
3rd Author's Affiliation | Faculty of Engineering, Yamagata University |
Date | 2001/7/18 |
Paper # | ISEC2001-26 |
Volume (vol) | vol.101 |
Number (no) | 214 |
Page | pp.pp.- |
#Pages | 6 |
Date of Issue |