{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:27:29Z","timestamp":1759134449247},"reference-count":15,"publisher":"Elsevier BV","issue":"14","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1016\/s0167-8191(96)00085-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:16:06Z","timestamp":1027613766000},"page":"1985-1996","source":"Crossref","is-referenced-by-count":26,"title":["A parallel two-list algorithm for the knapsack problem"],"prefix":"10.1016","volume":"22","author":[{"given":"Der-Chyuan","family":"Lou","sequence":"first","affiliation":[]},{"given":"Chin-Chen","family":"Chang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1989","author":"Akl","key":"10.1016\/S0167-8191(96)00085-3_bib1"},{"issue":"2","key":"10.1016\/S0167-8191(96)00085-3_bib2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0167-8191(94)90083-3","article-title":"A parallel algorithm for the knapsack problem using a generation and searching technique","volume":"20","author":"Chang","year":"1994","journal-title":"Parallel Computing"},{"issue":"5","key":"10.1016\/S0167-8191(96)00085-3_bib3","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1109\/18.21214","article-title":"A knapsack-type public key cryptosystem based on arithmetic in finite fields","volume":"34","author":"Chor","year":"1988","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"10.1016\/S0167-8191(96)00085-3_bib4","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0167-8191(89)90121-X","article-title":"The two-list algorithm for the knapsack problem on a FPS T20","volume":"9","author":"Cosnard","year":"1989","journal-title":"Parallel Computing"},{"issue":"4","key":"10.1016\/S0167-8191(96)00085-3_bib5","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1109\/TIT.1984.1056932","article-title":"A critical analysis of the security of knapsack public-key algorithms","volume":"30","author":"Desmedt","year":"1994","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"10.1016\/S0167-8191(96)00085-3_bib6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1109\/12.73593","article-title":"A parallel time\/hardware tradeoff T \u00b7 H = O (2n\/2) for the knapsack problem","volume":"40","author":"Ferreira","year":"1991","journal-title":"IEEE Trans. Comput."},{"year":"1979","author":"Garey","key":"10.1016\/S0167-8191(96)00085-3_bib7"},{"issue":"2","key":"10.1016\/S0167-8191(96)00085-3_bib8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/321812.321823","article-title":"Computing partitions with applications to the knapsack problem","volume":"21","author":"Horowitz","year":"1974","journal-title":"J. ACM"},{"year":"1978","author":"Horowitz","key":"10.1016\/S0167-8191(96)00085-3_bib9"},{"issue":"5","key":"10.1016\/S0167-8191(96)00085-3_bib10","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1109\/TC.1984.1676456","article-title":"A parallel algorithm for the knapsack problem","volume":"33","author":"Karnin","year":"1984","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/S0167-8191(96)00085-3_bib11","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1109\/49.17717","article-title":"Linearly shift knapsack public-key cryptosystem","volume":"7","author":"Laih","year":"1989","journal-title":"IEEE J. Selected Areas Commun."},{"issue":"5","key":"10.1016\/S0167-8191(96)00085-3_bib12","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","article-title":"Hiding information and signatures in trapdoor knapsacks","volume":"24","author":"Merkle","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"10.1016\/S0167-8191(96)00085-3_bib13","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/358699.358718","article-title":"On the security of multiple encryption","volume":"24","author":"Merkle","year":"1981","journal-title":"Comm. ACM"},{"issue":"3","key":"10.1016\/S0167-8191(96)00085-3_bib14","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1137\/0210033","article-title":"A T = O (2n\/2) S = O (2n\/4) algorithm for certain NP-complete problems","volume":"10","author":"Schroeppel","year":"1981","journal-title":"SIAM J. Comput"},{"issue":"5","key":"10.1016\/S0167-8191(96)00085-3_bib15","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1109\/TIT.1984.1056964","article-title":"A polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem","volume":"30","author":"Shamir","year":"1984","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819196000853?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819196000853?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T06:55:56Z","timestamp":1556261756000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819196000853"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":15,"journal-issue":{"issue":"14","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0167819196000853"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(96)00085-3","relation":{},"ISSN":["0167-8191"],"issn-type":[{"type":"print","value":"0167-8191"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}