| Presentation | 2010-09-10 A Construction of New Class of Knapsack-Type Public Key Cryptosystem, K(II)ΣPKC Masao KASAHARA, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In this paper, we present a new class of knapsack type PKC referred to as K(II)ΣPKC. In a sharp contrast with the conventional knapsack type PKC's, in our proposed scheme, K(II)ΣPKC, no secret sequence is used. We show that the coding rate, a more conservative measure for the security of knapsack PKC, can be made sufficiently large. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | cryptosystem(PKC) / Knapsack type PKC / Subset-sum problem / LLL algorithm / PQC |
| Paper # | ISEC2010-42 |
| Date of Issue |
| Conference Information | |
| Committee | ISEC |
|---|---|
| Conference Date | 2010/9/3(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 | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A Construction of New Class of Knapsack-Type Public Key Cryptosystem, K(II)ΣPKC |
| Sub Title (in English) | |
| Keyword(1) | cryptosystem(PKC) |
| Keyword(2) | Knapsack type PKC |
| Keyword(3) | Subset-sum problem |
| Keyword(4) | LLL algorithm |
| Keyword(5) | PQC |
| 1st Author's Name | Masao KASAHARA |
| 1st Author's Affiliation | Faculty of Informatics, Osaka Gakuin University() |
| Date | 2010-09-10 |
| Paper # | ISEC2010-42 |
| Volume (vol) | vol.110 |
| Number (no) | 200 |
| Page | pp.pp.- |
| #Pages | 4 |
| Date of Issue | |