{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T00:15:19Z","timestamp":1775693719305,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,5,26]],"date-time":"2021-05-26T00:00:00Z","timestamp":1621987200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,26]],"date-time":"2021-05-26T00:00:00Z","timestamp":1621987200000},"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":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s11432-020-2958-9","type":"journal-article","created":{"date-parts":[[2021,5,29]],"date-time":"2021-05-29T16:05:03Z","timestamp":1622304303000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A detailed analysis of primal attack and its variants"],"prefix":"10.1007","volume":"65","author":[{"given":"Xue","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongxiang","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,26]]},"reference":[{"key":"2958_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev O. On lattices, learning with errors, random linear codes, and cryptography. J ACM, 2009, 56: 1\u201340","journal-title":"J ACM"},{"key":"2958_CR2","unstructured":"Alkim E, Ducas L, P\u00f6ppelmann T, et al. Post-quantum key exchange \u2014 a new hope. In: Proceedings of the 25th USENIX Security Symposium, Austin, 2016. 327\u2013343"},{"key":"2958_CR3","doi-asserted-by":"crossref","unstructured":"Bos J W, Costello C, Ducas L, et al. Frodo: take off the ring! practical, quantum-secure key exchange from LWE. In: Proceedings of ACM SIGSAC Conference on Computer and Communications Security, Vienna, 2016. 1006\u20131018","DOI":"10.1145\/2976749.2978425"},{"key":"2958_CR4","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/120868669","volume":"42","author":"Z Brakerski","year":"2014","unstructured":"Brakerski Z, Vaikuntanathan V. Efficient fully homomorphic encryption from standard LWE. SIAM J Comput, 2014, 42: 831\u2013871","journal-title":"SIAM J Comput"},{"key":"2958_CR5","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V. Lattice signatures without trapdoors. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2012. 738\u2013755","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"2958_CR6","doi-asserted-by":"crossref","unstructured":"Garg S, Gentry C, Halevi S. Candidate multilinear maps from ideal lattices. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2013","DOI":"10.1007\/978-3-642-38348-9_1"},{"key":"2958_CR7","doi-asserted-by":"crossref","unstructured":"Albrecht M R. On dual lattice attacks against small-secret LWE and parameter choices in helib and SEAL. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2017. 103\u2013129","DOI":"10.1007\/978-3-319-56614-6_4"},{"key":"2958_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/jmc-2016-0044","volume":"13","author":"T Wunderer","year":"2019","unstructured":"Wunderer T. A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack. J Math Cryptol, 2019, 13: 1\u201326","journal-title":"J Math Cryptol"},{"key":"2958_CR9","doi-asserted-by":"crossref","unstructured":"Guo Q, Johansson T, Martensson E, et al. Coded-BKW with sieving. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security, 2017. 323\u2013346","DOI":"10.1007\/978-3-319-70694-8_12"},{"key":"2958_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s00145-018-9304-1","volume":"32","author":"S Bai","year":"2019","unstructured":"Bai S, Galbraith S D, Li L Z, et al. Improved combinatorial algorithms for the inhomogeneous short integer solution problem. J Cryptol, 2019, 32: 35\u201383","journal-title":"J Cryptol"},{"key":"2958_CR11","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/2815111.2815158","volume":"49","author":"M R Albrecht","year":"2015","unstructured":"Albrecht M R, Cid C, Faug\u00e9re J C, et al. Algebraic algorithms for LWE problems. ACM Commun Comput Algebra, 2015, 49: 62","journal-title":"ACM Commun Comput Algebra"},{"key":"2958_CR12","doi-asserted-by":"crossref","unstructured":"Albrecht M R, Fitzpatrick R, G\u00f6pfert F. On the efficacy of solving LWE by reduction to unique-svp. In: Proceedings of International Conference on Information Security and Cryptology, 2013. 293\u2013310","DOI":"10.1007\/978-3-319-12160-4_18"},{"key":"2958_CR13","doi-asserted-by":"crossref","unstructured":"Bai S, Galbraith S D. Lattice decoding attacks on binary LWE. In: Proceedings of Australasian Conference on Information Security and Privacy, 2014. 322\u2013337","DOI":"10.1007\/978-3-319-08344-5_21"},{"key":"2958_CR14","doi-asserted-by":"crossref","unstructured":"Albrecht M R, G\u00f6pfert F, Virdia F, et al. Revisiting the expected cost of solving usvp and applications to LWE. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security, 2017. 297\u2013322","DOI":"10.1007\/978-3-319-70694-8_11"},{"key":"2958_CR15","doi-asserted-by":"crossref","unstructured":"Albrecht M R, Curtis B R, Wunderer T. Exploring trade-offs in batch bounded distance decoding. In: Proceedings of International Conference on Selected Areas in Cryptography, 2019. 467\u2013491","DOI":"10.1007\/978-3-030-38471-5_19"},{"key":"2958_CR16","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"M R Albrecht","year":"2015","unstructured":"Albrecht M R, Player R, Scott S. On the concrete hardness of learning with errors. J Math Cryptol, 2015, 9: 169\u2013203","journal-title":"J Math Cryptol"},{"key":"2958_CR17","doi-asserted-by":"crossref","unstructured":"Gama N, Nguyen P Q. Predicting lattice reduction. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2008. 31\u201351","DOI":"10.1007\/978-3-540-78967-3_3"},{"key":"2958_CR18","unstructured":"Chen Y M. R\u00e9duction de r\u00e9seau et s\u00e9curit\u00e9 concrete du chiffrement completement homomorphe. Dissertation for Ph.D. Degree. Paris: \u00c9cole Normale Sup\u00e9rieure, 2013"},{"key":"2958_CR19","doi-asserted-by":"crossref","unstructured":"Hanrot G, Pujol X, Stehl\u00e9 D. Analyzing blockwise lattice algorithms using dynamical systems. In: Proceedings of Annual Cryptology Conference, 2011. 447\u2013464","DOI":"10.1007\/978-3-642-22792-9_25"},{"key":"2958_CR20","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan R. Minkowski\u2019s convex body theorem and integer programming. Math Oper Res, 1987, 12: 415\u2013440","journal-title":"Math Oper Res"},{"key":"2958_CR21","doi-asserted-by":"crossref","unstructured":"Chen Y M, Nguyen P Q. BKZ 2.0: better lattice security estimates. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security, 2011","DOI":"10.1007\/978-3-642-25385-0_1"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-020-2958-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-020-2958-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-020-2958-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,29]],"date-time":"2021-05-29T16:15:57Z","timestamp":1622304957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-020-2958-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,26]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["2958"],"URL":"https:\/\/doi.org\/10.1007\/s11432-020-2958-9","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,26]]},"assertion":[{"value":"17 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"132301"}}