Search
Now showing items 11-12 of 12
On the Cryptocomplexity of Knapsack Systems
(1979-04)
A recent trend in cryptographic systems is to base their encryption/decryption functions on NP-complete problems, and in particular on the knapsack problem. To analyze the security of these systems, we need a complexity ...
A T=0(2^n/2), S=0(2^n/4) Algorithm for Certain NP-Complete Problems
(1980-01)
In this paper we develop a general prupose algorithm that can solve a number of NP-complete problems in time T=0(2^n/2) and space S=0(2^n/4). The algorithm can be generalized to a family of algorithms whose time and space ...