{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T18:02:32Z","timestamp":1748455352839},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540133452"},{"type":"electronic","value":"9783540388869"}],"license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13345-3_28","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:02:18Z","timestamp":1330192938000},"page":"312-323","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Performance analysis of Shamir's attack on the basic Merkle-Hellman knapsack cryptosystem"],"prefix":"10.1007","author":[{"given":"J. C.","family":"Lagarias","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"L. Adleman, On Breaking Generalized Knapsack Cryptosystems, Proc. 15th Annual ACM Symposium on Theory of Computing, 1983, pp. 402\u2013412.","DOI":"10.1145\/800061.808771"},{"key":"28_CR2","volume-title":"Advances in Cryptology, Proceedings of Crypto-83","author":"E. Brickell","year":"1984","unstructured":"E. Brickell, Solving Low Density Knapsacks, in: Advances in Cryptology, Proceedings of Crypto-83 (D. Chaum, Ed.), Plenum Publ. Co., New York 1984."},{"key":"28_CR3","volume-title":"Advances in Cryptology Proceeding of Crypto-83","author":"E. Brickell","year":"1984","unstructured":"E. Brickell, J. C. Lagarias and A. M. Odlyzko, Evaluation of Adleman's Attack on Multiply Iterated Knapsacks (Abstract), Advances in Cryptology Proceeding of Crypto-83 (D. Chaum, Ed.), Plenum Publ. Co., New York 1984."},{"key":"28_CR4","unstructured":"Y. Desmedt, J. Vandewalle, R. Govaerts, A Critical Analysis of the Security of Knapsack Public Key Cryptosystems, preprint."},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"R. Kannan, Improved Algorithms for Integer Programming and Related Lattice Problems, Proc. 15th Annual ACM Symposium on theory of Computing, 1983, pp. 193\u2013206.","DOI":"10.1145\/800061.808749"},{"key":"28_CR6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-1-4684-4730-9_1","volume-title":"Advances in Cryptology, Proceedings of Crypto-83","author":"J. C. Lagarias","year":"1984","unstructured":"J. C. Lagarias, Knapsack Public Key Cryptosystems and Diophantine Approximation (Extend Abstract), Advances in Cryptology, Proceedings of Crypto-83 (D. Chaum, Ed.), Plenum Publ. Co., New York, 1984, pp. 3\u201324."},{"key":"28_CR7","unstructured":"J. C. Lagarias, Simultaneous Diophantine Approximation of Rationals by Rationals, preprint."},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"J. C. Lagarias and A. M. Odlyzko, Solving Low Density Subset Sum Problems, Proc. 24th IEEE Symposium on Foundations of Computer Science, 1983, pp. 1\u201310.","DOI":"10.1109\/SFCS.1983.70"},{"key":"28_CR9","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A. K. Lenstra","year":"1982","unstructured":"A. K. Lenstra, H. W. Lenstra, Jr. and L. Lovasz, Factoring polynomials with rational coefficients, Math. Annalen. 261 (1982), pp. 515\u2013534.","journal-title":"Math. Annalen."},{"key":"28_CR10","unstructured":"H. W. Lenstra, Jr., Integer programming with a fixed number of variables, Math. of Operations Research, to appear."},{"key":"28_CR11","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"IT-24","author":"R. Merkle","year":"1978","unstructured":"R. Merkle and M. Hellman, Hiding Information and Signatures in Trapdoor Knapsacks, IEEE Trans. Information Theory IT-24 (1978), pp. 525\u2013530.","journal-title":"IEEE Trans. Information Theory"},{"key":"28_CR12","unstructured":"A. M. Odlyzko, Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme, IEEE Trans. Information Theory, to appear."},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"A. Shamir, A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem, Proc. 23rd Annual Symposium on Foundations of Computer Science, 1982, pp. 145\u2013152.","DOI":"10.1109\/SFCS.1982.5"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-13345-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T03:08:39Z","timestamp":1593745719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13345-3_28"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133452","9783540388869"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-13345-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]},"assertion":[{"value":"28 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}