English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 49378/84106 (59%)
造訪人次 : 7362994      線上人數 : 65
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/45429

    題名: Generation of solved instances of Multiconstraint Knapsack problem and its applications to Private Key Cipher
    作者: Lin, Y. C.;Chow, Louis R.
    貢獻者: 淡江大學資訊工程學系
    日期: 1995
    上傳時間: 2010-03-26 19:15:04 (UTC+8)
    出版者: New Delhi: Taru Publications
    摘要: 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.
    關聯: Journal of Information and Optimization Sciences 16(2), pp.335-350
    DOI: 10.1080/02522667.1995.10699232
    顯示於類別:[資訊工程學系暨研究所] 期刊論文





    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋