Abstract
Let al,...,an and s be a set of integers. The knapsack (or subset sum) problem is to find a 0–1 vector (el,...,en) such that Σ eiai = s or to show that such a vector does not exist. The integers al,...,an are sometimes referred to as weights. The general knapsack problem is known to be NP complete [5,6]. Several cryptosystems based on the knapsack problem have been designed [9,12,16]. In April, 1982, Adi Shamir [14] announced a method for breaking the Merkle-Hellman cryptosystem. Since that time there has been a flurry of activity to extend his results to include all of the proposed knapsack based cryptosystems [1,2,3,7,13].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
