Author:
Li Ken-Li,Li Ren-Fa,Li Qing-Hua
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Science Applications,Hardware and Architecture,Theoretical Computer Science,Software
Reference17 articles.
1. Garey M R, Johnson D S. Computer and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, W H Freeman and Co., 1979.
2. Shamir A. A polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem.IEEE Trans. Inform. Theory, 1984, 30(5): 699–704.
3. Chor B, Rivest R L. A knapsack-type public key cryptosystem based on arithmetic in finite fields.IEEE Trans. Inform. Theory, 1988, 34(5): 901–909.
4. Laih C S, Lee J Y, Harin L, Su Y K. Linearly shift knapsack public-key cryptosystem.IEEE J. Selected Areas Commun, 1989, 7(4): 534–539.
5. Horowitz E, Sahni S. Computing partitions with applications to the knapsack problem.J. ACM, 1974, 21(2): 277–292.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献