{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T06:01:46Z","timestamp":1648879306622},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2009,10,1]],"date-time":"2009-10-01T00:00:00Z","timestamp":1254355200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Ser. F-Inf. Sci."],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s11432-009-0159-9","type":"journal-article","created":{"date-parts":[[2009,10,5]],"date-time":"2009-10-05T00:01:43Z","timestamp":1254700903000},"page":"1792-1800","source":"Crossref","is-referenced-by-count":0,"title":["Probability method for cryptanalysis of general multivariate modular linear equation"],"prefix":"10.1007","volume":"52","author":[{"given":"HaiJian","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DaoShun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YiQi","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,10,6]]},"reference":[{"key":"159_CR1","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"24","author":"R. Merkle","year":"1978","unstructured":"Merkle R, Hellman M. Hiding information and signatures in trapdoor knapsacks. IEEE Trans Inf Theory, 1978, 24: 525\u2013530","journal-title":"IEEE Trans Inf Theory"},{"key":"159_CR2","first-page":"16","volume":"1","author":"S. C. Lu","year":"1979","unstructured":"Lu S C, Lee L N. A simple and effective public-key cryptosystem. COMSAT Tech Rev, 1979, 1: 16\u201323","journal-title":"COMSAT Tech Rev"},{"key":"159_CR3","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1049\/el:19850560","volume":"18","author":"B. S. Adiga","year":"1985","unstructured":"Adiga B S, Shankar P. Modified Lu-Lee cryptosystem. Electron Lett, 1985, 18: 794\u2013795","journal-title":"Electron Lett"},{"issue":"4","key":"159_CR4","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BF01457454","volume":"261","author":"A. K. Lenstra","year":"1982","unstructured":"Lenstra A K, Lenstra H W, Lov\u00e1sz L. Factoring polynomials with rational coefficients. Math Ann, 1982, 261(4): 513\u2013534","journal-title":"Math Ann"},{"key":"159_CR5","doi-asserted-by":"crossref","unstructured":"Kannan R. Improved algorithm for integer programming and related lattice problems. In: Proc 15th ACM Symposium on Theory of Computing, Boston, Massachusetts, 1983. 193\u2013206","DOI":"10.1145\/800061.808749"},{"key":"159_CR6","unstructured":"Schnorr C P. Fast LLL-type lattice reduction. Unpublished draft available at http:\/\/www.mi.informatik.uni-frankfurt.de\/research\/papers.html , October 2004"},{"key":"159_CR7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C. P. Schnorr","year":"1994","unstructured":"Schnorr C P, Euchner M. Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math Program, 1994, 66: 181\u2013199","journal-title":"Math Program"},{"key":"159_CR8","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/11426639_13","volume-title":"Proceedings of Eurocrypt 2005","author":"P.Q. Nguyen","year":"2005","unstructured":"Nguyen PQ, Stehl\u00e9 D. Floating-point LLL revisited. In: Proceedings of Eurocrypt 2005. LNCS 3494. Berlin: Springer-Verlag, 2005. 215\u2013233"},{"key":"159_CR9","series-title":"LNCS","first-page":"146","volume-title":"Proc of CALC\u201901","author":"P. Q. Nguyen","year":"2001","unstructured":"Nguyen P Q, Stern J. The two faces of lattices in cryptology. In: Proc of CALC\u201901. LNCS 2146. Berlin: Springer-Verlag, 2001. 146\u2013180"},{"issue":"1","key":"159_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L. Babai","year":"1986","unstructured":"Babai L. On Lov\u00e1sz lattice reduction and the nearest lattice point problem. Combinatorica, 1986, 6(1): 1\u201313","journal-title":"Combinatorica"},{"key":"159_CR11","first-page":"601","volume-title":"Proc 33rd STOC","author":"M. Ajtai","year":"2001","unstructured":"Ajtai M, Kumar R, Sivakumar D. A sieve algorithm for the shortest lattice vector problem. In: Proc 33rd STOC. New York: ACM, 2001. 601\u2013610"},{"key":"159_CR12","series-title":"LNCS","first-page":"238","volume-title":"Proceeding of ANTS VII","author":"P. Q. Nguyen","year":"2006","unstructured":"Nguyen P Q, Stehl\u00e9 D. LLL on the average. In: Proceeding of ANTS VII. LNCS, 4076. Berlin: Springer-Verlag, 2006. 238\u2013256"},{"key":"159_CR13","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/978-3-540-78967-3_3","volume-title":"Proceedsings of Eurocrypt 2008","author":"N. Gama","year":"2008","unstructured":"Gama N, Nguyen P Q. Predicting lattice reduction. In: Proceedsings of Eurocrypt 2008. LNCS 4965. Berlin: Springer-Verlag, 2008. 31\u201351"},{"key":"159_CR14","unstructured":"Shoup V. NTL Number Theory C++ Library. Available at http:\/\/www.shoup.net\/ntl\/ ."},{"key":"159_CR15","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1109\/5.4443","volume":"76","author":"E. F. Brickell","year":"1988","unstructured":"Brickell E F, Odlyzko A M. Cryptanalysis: a survey of recent results. Proce IEEE, 1988, 76: 578\u2013592","journal-title":"Proce IEEE"},{"key":"159_CR16","series-title":"LNCS","first-page":"412","volume-title":"Proceedings of INSCRYPT 2007","author":"H. J. Zhou","year":"2008","unstructured":"Zhou H J, Luo P, Wang D S, et al. Cryptanalysis of general Lu-Lee type systems. In: Proceedings of INSCRYPT 2007. LNCS, 4990. Berlin: Springer-Verlag, 2008. 412\u2013426"}],"container-title":["Science in China Series F: Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-009-0159-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-009-0159-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-009-0159-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:36:01Z","timestamp":1559403361000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-009-0159-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10]]},"references-count":16,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["159"],"URL":"https:\/\/doi.org\/10.1007\/s11432-009-0159-9","relation":{},"ISSN":["1009-2757","1862-2836"],"issn-type":[{"value":"1009-2757","type":"print"},{"value":"1862-2836","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10]]}}}