期刊論文
| 學年 | 83 |
|---|---|
| 學期 | 1 |
| 出版（發表）日期 | 1995-01-01 |
| 作品名稱 | Generation of solved instances of Multiconstraint Knapsack problem and its applications to Private Key Cipher |
| 作品名稱（其他語言） | |
| 著者 | Lin, Y. C.; Chow, Louis R. |
| 單位 | 淡江大學資訊工程學系 |
| 出版者 | New Delhi: Taru Publications |
| 著錄名稱、卷期、頁數 | Journal of Information and Optimization Sciences 16(2), pp.335-350 |
| 摘要 | This papers explores the relations between the generation of solved instances of optimization problem and the design of private key cipher. A class of ciphers derived from complementary slackness conditions of multiconstraint knapsack problem (MKP) are presented and discussed. It is shown that under plaintext attack, any algorithm that predicts the embedded key sequence generator of the ciphers also solves a sequence of instances of MKP. It is also shown that even under P=NP and additional assumption, security under plaintext attack of the proposed ciphers is equivalent to their associative key sequence generator. |
| 關鍵字 | |
| 語言 | en |
| ISSN | 0252-2667 2169-0103 |
| 期刊性質 | 國外 |
| 收錄於 | EI |
| 產學合作 | |
| 通訊作者 | |
| 審稿制度 | 否 |
| 國別 | IND |
| 公開徵稿 | |
| 出版型式 | ,電子版,紙本 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/45429 ) |