{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T09:25:26Z","timestamp":1672392326800},"reference-count":4,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,8,1]],"date-time":"1983-08-01T00:00:00Z","timestamp":428544000000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1983,8]]},"DOI":"10.1016\/0020-0190(83)90074-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:20:15Z","timestamp":1027657215000},"page":"77-79","source":"Crossref","is-referenced-by-count":7,"title":["Embedding cryptographic trapdoors in arbitrary knapsack systems"],"prefix":"10.1016","volume":"17","author":[{"given":"Adi","family":"Shamir","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(83)90074-1_BIB1","article-title":"The computational complexity of simultaneous diophantine approximation problems","author":"Lagarias","year":"1982","journal-title":"Proc. 23rd Conf. on Foundations of Computer Science"},{"issue":"5","key":"10.1016\/0020-0190(83)90074-1_BIB2","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.1978.1055927","article-title":"Hiding information and signatures in trapdoor knapsacks","volume":"IT-24","author":"Merkle","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"10.1016\/0020-0190(83)90074-1_BIB3","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.1980.1056197","article-title":"On the security of the Merkle-Hellman cryptographic scheme","volume":"IT-26","author":"Shamir","year":"1980","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0020-0190(83)90074-1_BIB4","article-title":"A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem","author":"Shamir","year":"1982","journal-title":"Proc. 23rd Conf. on Foundations of Computer Science"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900741?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900741?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T14:32:36Z","timestamp":1580913156000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019083900741"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,8]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,8]]}},"alternative-id":["0020019083900741"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(83)90074-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1983,8]]}}}