{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T02:42:59Z","timestamp":1747104179068},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,7,1]],"date-time":"1983-07-01T00:00:00Z","timestamp":425865600000},"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,7]]},"DOI":"10.1016\/0020-0190(83)90083-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"7-11","source":"Crossref","is-referenced-by-count":6,"title":["Trapdoor knapsacks without superincreasing structure"],"prefix":"10.1016","volume":"17","author":[{"given":"Michael","family":"Willett","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(83)90083-2_BIB1","series-title":"Data Encryption Standard","volume":"46","year":"1977"},{"key":"10.1016\/0020-0190(83)90083-2_BIB2","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","article-title":"New directions in cryptography","volume":"IT-22","author":"Diffie","year":"1976","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0020-0190(83)90083-2_BIB3","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0020-0190(83)90083-2_BIB4","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","article-title":"Hiding information and receipts in trapdoor knapsacks","volume":"IT-24","author":"Merkle","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0020-0190(83)90083-2_BIB5","first-page":"27","article-title":"A data link encryption system","author":"Myers","year":"1979","journal-title":"Proc. Nat. Telecommunications Conf. (NTC-79)"},{"key":"10.1016\/0020-0190(83)90083-2_BIB6","doi-asserted-by":"crossref","unstructured":"Federal Register, Volume 47, Number 126, 30June 1982.","DOI":"10.1524\/phil.1982.126.12.324"},{"key":"10.1016\/0020-0190(83)90083-2_BIB7","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A method for obtaining digital signatures and public key cryptosystems","volume":"21","author":"Rivest","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(83)90083-2_BIB8","first-page":"118","article-title":"On the cryptocomplexity of knapsack systems","author":"Shamir","year":"1979","journal-title":"Proc. 11th ACM Symp. on the Theory of Computing"},{"key":"10.1016\/0020-0190(83)90083-2_BIB9","article-title":"A polynomial time algorithm for breaking Merkle-Hellman cryptosystems","author":"Shamir","year":"1982","journal-title":"Research Announcement"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900832?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900832?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T13:42:43Z","timestamp":1580910163000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019083900832"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,7]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,7]]}},"alternative-id":["0020019083900832"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(83)90083-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1983,7]]}}}