{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:33:22Z","timestamp":1774370002763,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540573326","type":"print"},{"value":"9783540480662","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57332-1_40","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:51:25Z","timestamp":1330260685000},"page":"470-476","source":"Crossref","is-referenced-by-count":5,"title":["Cryptanalysis of another knapsack cryptosystem"],"prefix":"10.1007","author":[{"given":"Antoine","family":"Joux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques","family":"Stern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"L. Adleman. On breaking the iterated Merkle-Hellman public key cryptosystem. Proceedings of the ACM Symposium on the Theory of Computing (1982) 402\u2013412.","DOI":"10.1007\/978-1-4757-0602-4_29"},{"key":"40_CR2","unstructured":"E. Brickell. Solving low density knapsacks. Proceedings of Crypto 83."},{"key":"40_CR3","unstructured":"E. Brickell. Breaking Iterated Knapsacks. Proceedings of Crypto 84. Lecture Notes in Computer Science 196."},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"E. Brickell and A. M. Odlyzko. Cryptanalysis: A survey of recent results. Proceedings IEEE 1988.","DOI":"10.1109\/5.4443"},{"key":"40_CR5","unstructured":"Y. M. Chee. The Cryptanalysis of a New Public-Key Cryptosystem based on Modular Knapsacks. Proceedings of Crypto 91. Lecture Notes in Computer Science, to appear."},{"key":"40_CR6","unstructured":"M. J. Coster, A. Joux, B. A. LaMacchia, A. Odlyzko, C. P. Schnorr and J. Stern. Improved Low-Density Subset Sum Algorithms. To appear."},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"R. Kannan. Improved algorithms for integer programming and related lattice problems. Proceedings of the ACM Symposium on the Theory of Computing. (1983), 193\u2013206.","DOI":"10.1145\/800061.808749"},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"R. Kannan, A. K. Lenstra and L. Lov\u00e0sz. Polynomial factorisation and nonrandomness of bits of algebraic and some transcendental numbers, Carnegie-Mellon University. Computer Science Department Technical Report (1984).","DOI":"10.1145\/800057.808681"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"J. C. Lagarias and A. M. Odlyzko. Solving low-density subset sum problems. Proceedings of IEEE symposium on the foundations of Computer Science. (1983) 1\u201310.","DOI":"10.1109\/SFCS.1983.70"},{"key":"40_CR10","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A. K. Lenstra","year":"1982","unstructured":"A. K. Lenstra, H. W. Lenstra and L. Lov\u00e0sz. Factoring polynomials with rational coefficients. Math. Annalen 261 (1982) 515\u2013534.","journal-title":"Math. Annalen"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"V. Niemi. A new trapdoor in knapsacks. Advances in Cryptography \u2014 Proceedings of EUROCRYPT 90, Lecture Notes in Computer Science, to appear.","DOI":"10.1007\/3-540-46877-3_36"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"A. Shamir. A polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem. Proceedings of th IEEE symposium on the foundations of Computer Science. (1982) 145\u2013152.","DOI":"10.1109\/SFCS.1982.5"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"J. Stern. Secret linear congruential generators are not cryptographically secure. Proceedings of the IEEE symposium on the foundations of Computer Science. (1987) 421\u2013426.","DOI":"10.1109\/SFCS.1987.51"},{"key":"40_CR14","unstructured":"J. Stern and P. Toffin. Crypanalysis of a public-key cryptosystem based on approximations by rational numbers. Advances in Cryptography \u2014 Proceedings of EUROCRYPT 90, Lecture Notes in Computer Science 473."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57332-1_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:11:40Z","timestamp":1605647500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57332-1_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573326","9783540480662"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-57332-1_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}