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

機構典藏 > College of Engineering > Graduate Institute & Department of Computer Science and Information Engineering > Journal Article > Item 987654321/45429

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/45429

Title:	Generation of solved instances of Multiconstraint Knapsack problem and its applications to Private Key Cipher
Authors:	Lin, Y. C.;Chow, Louis R.
Contributors:	淡江大學資訊工程學系
Date:	1995-01-01
Issue Date:	2010-03-26 19:15:04 (UTC+8)
Publisher:	New Delhi: Taru Publications
Abstract:	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.
Relation:	Journal of Information and Optimization Sciences 16(2), pp.335-350
DOI:	10.1080/02522667.1995.10699232
Appears in Collections:	[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

Files in This Item:

There are no files associated with this item.