{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:17:41Z","timestamp":1778296661808,"version":"3.51.4"},"reference-count":5,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[1980,5,1]],"date-time":"1980-05-01T00:00:00Z","timestamp":325987200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1980,5,1]],"date-time":"1980-05-01T00:00:00Z","timestamp":325987200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1980,5,1]],"date-time":"1980-05-01T00:00:00Z","timestamp":325987200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[1980,5]]},"DOI":"10.1109\/tit.1980.1056197","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T14:27:04Z","timestamp":1083076024000},"page":"339-340","source":"Crossref","is-referenced-by-count":37,"title":["On the security of the Merkle- Hellman cryptographic scheme (Corresp.)"],"prefix":"10.1109","volume":"26","author":[{"given":"A.","family":"Shamir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Zippel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","author":"cassels","year":"1965","journal-title":"An Introduction to Diophantine Approximation"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"ref5","author":"leveque","year":"1977","journal-title":"Fundamentals of Number Theory"},{"key":"ref2","author":"karp","year":"1972","journal-title":"Complexity of Computer Computations"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055927"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22714\/01056197.pdf?arnumber=1056197","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T17:58:23Z","timestamp":1752775103000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1056197\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,5]]},"references-count":5,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.1980.1056197","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,5]]}}}