A parallel two-list algorithm for the knapsack problem

Parallel Computing

Volumn 22, Issue 14, 1997, Pages 1985-1996

  Lou, Der Chyuan ^a   Chang, Chin Chen ^a  

^a NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

Author keywords

Cryptosystem; Knapsack problem; NP complete problems; Parallel algorithms

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; MULTIPROCESSING SYSTEMS; PROBLEM SOLVING; PROGRAM PROCESSORS;

EXHAUSTIVE SEARCH; KNAPSACK PROBLEM; PARALLEL TWO LIST ALGORITHM;

PARALLEL ALGORITHMS;

EID: 0031100341     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-8191(96)00085-3     Document Type: Article

References (15)

1. S.G. Akl, The Design and Analysis of Parallel Algorithms (Prentice-Hall, Englewood Cliffs, NJ, 1989).
2. H.K.-C. Chang, J.J.-R. Chen and S.-J. Shyu, A parallel algorithm for the knapsack problem using a generation and searching technique, Parallel Computing 20 (2) (1994) 233-243.
3. B. Chor and R.L. Rivest, A knapsack-type public key cryptosystem based on arithmetic in finite fields, IEEE Trans. Inform. Theory 34 (5) (1988) 901-909.
4. M. Cosnard, A.G. Ferreira and H. Herbelin, The two-list algorithm for the knapsack problem on a FPS T20, Parallel Computing 9 (3) (1989) 385-388.
5. Y.G. Desmedt, J.P. Vandewalle and R.M. Govaerts, A critical analysis of the security of knapsack public-key algorithms, IEEE Trans. Inform. Theory 30 (4) (1994) 601-611.
6. n/2) for the knapsack problem, IEEE Trans. Comput. 40 (2) (1991) 221-225.
7. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
8. E. Horowitz and S. Sahni, Computing partitions with applications to the knapsack problem, J. ACM 21 (2) (1974) 277-292.
9. E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms (Computer Science Press, Rockville, MD, 1978).
10. E.D. Karnin, A parallel algorithm for the knapsack problem, IEEE Trans. Comput. 33 (5) (1984) 404-408.
11. C.-S. Laih, J.-Y. Lee, L. Ham and Y.-K. Su, Linearly shift knapsack public-key cryptosystem, IEEE J. Selected Areas Commun. 7 (4) (1989) 534-539.
12. R.C. Merkle and M.E. Hellman, Hiding information and signatures in trapdoor knapsacks, IEEE Trans. Inform. Theory 24 (5) (1978) 525-530.
13. R.C. Merkle and M.E. Hellman, On the security of multiple encryption, Comm. ACM 24 (7) (1981) 465-467.
14. n/4) algorithm for certain NP-complete problems, SIAM J. Comput 10 (3) (1981) 456-464.
15. A. Shamir, A polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem, IEEE Trans. Inform. Theory 30 (5) (1984) 699-704.