{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T18:32:16Z","timestamp":1694629936007},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,4,1]],"date-time":"2007-04-01T00:00:00Z","timestamp":1175385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2007,4,1]],"date-time":"2007-04-01T00:00:00Z","timestamp":1175385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[2007,4]]},"DOI":"10.1007\/s10623-007-9058-5","type":"journal-article","created":{"date-parts":[[2007,4,3]],"date-time":"2007-04-03T15:53:48Z","timestamp":1175615628000},"page":"47-59","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Low-density attack revisited"],"prefix":"10.1007","volume":"43","author":[{"given":"Tetsuya","family":"Izu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Kogure","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Koshiba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Shimoyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,4,4]]},"reference":[{"key":"9058_CR1","doi-asserted-by":"crossref","unstructured":"Brickell EF (1985) Breaking iterated knapsacks. In Blakley GR, Chaum D (eds) Advances in cryptology: proceedings of CRYPTO\u201984 (Lecture notes in computer science). vol 1960. Springer-Verlag, New York, pp 342\u2013358","DOI":"10.1007\/3-540-39568-7_27"},{"key":"9058_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01201999","volume":"2","author":"MJ Coster","year":"1992","unstructured":"Coster MJ, Joux A, LaMacchia BA, Odlyzko AM, Schnorr CP, Stern J (1992). Improved low-density subset sum algorithms. Comput Complexity 2: 111\u2013128","journal-title":"Comput Complexity"},{"issue":"5","key":"9058_CR3","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1109\/18.21214","volume":"34","author":"B Chor","year":"1988","unstructured":"Chor B, Rivest RL (1988). A knapsack-type public key cryptosystem based on arithmetic in finite fields. IEEE Trans Inf Theory 34(5): 901\u2013909","journal-title":"IEEE Trans Inf Theory"},{"key":"9058_CR4","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979). Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, San Fransisco, CA"},{"key":"9058_CR5","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra AK, Lenstra HW Jr, Lov\u00e1sz L (1982). Factoring polynomials with rational coefficients. Math Ann 261: 515\u2013534","journal-title":"Math Ann"},{"issue":"1","key":"9058_CR6","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"JC Lagarias","year":"1985","unstructured":"Lagarias JC, Odlyzko AM (1985). Solving low-density subset sum problems. J Assoc Comput Mach 32(1): 229\u2013246","journal-title":"J Assoc Comput Mach"},{"key":"9058_CR7","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"24","author":"RC Merkle","year":"1978","unstructured":"Merkle RC, Hellman ME (1978). Hiding information and signatures in trapdoor knapsacks. IEEE Trans Inf Theory 24: 525\u2013534","journal-title":"IEEE Trans Inf Theory"},{"key":"9058_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF01571276","volume":"110","author":"JE Mazo","year":"1990","unstructured":"Mazo JE, Odlyzko AM (1990). Lattice points in high-dimensional spheres. Monatsh Math 110: 47\u201361","journal-title":"Monatsh Math"},{"key":"#cr-split#-9058_CR9.1","doi-asserted-by":"crossref","unstructured":"Okamoto T, Tanaka K, Uchiyama S (2000) Quantum public-key cryptosystems. In: Bellare M","DOI":"10.1007\/3-540-44598-6_9"},{"key":"#cr-split#-9058_CR9.2","unstructured":"(ed) Advances in cryptology: proceedings of CRYPTO 2000 (Lecture notes in computer science) vol 1880. Springer-Verlag, New York pp 147-165"},{"key":"9058_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"CP Schnorr","year":"1994","unstructured":"Schnorr CP, Euchner M (1994). Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math Program 66: 181\u2013199","journal-title":"Math Program"},{"key":"9058_CR11","doi-asserted-by":"crossref","unstructured":"Schnorr CP, H\u00f6rner HH (1995) Attacking the Chor-Rivest cryptosystem by improved lattice reduction. In: Guillou LC, Quisquater J-J (eds) Advances in cryptology: proceedings of EUROCRYPT\u201995 (Lecture notes in computer science) vol 921. Springer-Verlag, New York, pp 1\u201312","DOI":"10.1007\/3-540-49264-X_1"},{"key":"9058_CR12","doi-asserted-by":"crossref","unstructured":"Shamir A (1982) A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem. In proceedings of the 23rd annual symposium on foundations of computer science. IEEE Compu. Soc., Chicago, USA pp 145\u2013152.","DOI":"10.1109\/SFCS.1982.5"},{"issue":"2","key":"9058_CR13","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s001450010005","volume":"14","author":"S Vaudenay","year":"2001","unstructured":"Vaudenay S (2001). Cryptanalysis of the Chor-Rivest cryptosystem. J Cryptol 14(2): 87\u2013100","journal-title":"J Cryptol"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9058-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-007-9058-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9058-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9058-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,18]],"date-time":"2022-05-18T05:35:52Z","timestamp":1652852152000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-007-9058-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,4]]}},"alternative-id":["9058"],"URL":"https:\/\/doi.org\/10.1007\/s10623-007-9058-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,4]]},"assertion":[{"value":"29 November 2005","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2007","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2007","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}