Generation of solved instances of Multiconstraint Knapsack problem and its applications to Private Key Cipher

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 期刊論文 > Item 987654321/45429

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/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-01-01
上传时间:	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
显示于类别:	[資訊工程學系暨研究所] 期刊論文

文件中的档案:

没有与此文件相关的档案.

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章