{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T12:10:18Z","timestamp":1725019818765},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T00:00:00Z","timestamp":1698192000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T00:00:00Z","timestamp":1698192000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s11424-023-3107-7","type":"journal-article","created":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T06:01:41Z","timestamp":1698213701000},"page":"2262-2292","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A New Random Sampling Method and Its Application in Improving Progressive BKZ Algorithm"],"prefix":"10.1007","volume":"37","author":[{"given":"Minghao","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shixiong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longjiang","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,25]]},"reference":[{"key":"3107_CR1","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-46665-7_29","volume":"1746","author":"R Fischlin","year":"1999","unstructured":"Fischlin R and Seifert J P, Tensor-based trapdoors for CVP and their application to public key cryptography, IMA International Conference on Cryptography and Coding, 1999, 1746: 244\u2013257.","journal-title":"IMA International Conference on Cryptography and Coding"},{"key":"3107_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-1711-2","volume-title":"An Introduction to Mathematical Cryptography","author":"J Hoffstein","year":"2014","unstructured":"Hoffstein J, Pipher J, Silverman J H, et al., An Introduction to Mathematical Cryptography, 2nd Edition, Springer, New York, 2014.","edition":"2nd Edition"},{"issue":"6","key":"3107_CR3","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, Journal of the ACM, 2009, 56(6): 1\u201340.","journal-title":"Journal of the ACM"},{"key":"3107_CR4","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-22792-9_29","volume":"6841","author":"Z Brakerski","year":"2011","unstructured":"Brakerski Z and Vaikuntanathan V, Fully homomorphic encryption from ring-lwe and security for key dependent messages, CRYPTO 2011, 2011, 6841: 505\u2013524.","journal-title":"CRYPTO 2011"},{"key":"3107_CR5","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing, New York","author":"C Gentry","year":"2009","unstructured":"Gentry C, Fully homomorphic encryption using ideal lattices, Proceedings of the 41st Annual ACM Symposium on Theory of Computing, New York, 2009."},{"issue":"3","key":"3107_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2724713","volume":"14","author":"J Howe","year":"2015","unstructured":"Howe J, P\u00f6ppelmann T, O\u2019neill M, et al., Practical lattice-based digital signature schemes, ACM Transactions on Embedded Computing Systems (TECS), 2015, 14(3): 1\u201324.","journal-title":"ACM Transactions on Embedded Computing Systems (TECS)"},{"issue":"1","key":"3107_CR7","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/s11424-015-3324-9","volume":"29","author":"Y Pan","year":"2016","unstructured":"Pan Y and Zhang F, Solving low-density multiple subset sum problems with SVP oracle, Journal of Systems Science & Complexity, 2016, 29(1): 228\u2013242.","journal-title":"Journal of Systems Science & Complexity"},{"issue":"3","key":"3107_CR8","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1007\/s11424-021-0074-8","volume":"35","author":"Y Deng","year":"2022","unstructured":"Deng Y, Luo L, Pan Y, et al., On some computational problems in local fields, Journal of Systems Science & Complexity, 2022, 35(3): 1191\u20131200.","journal-title":"Journal of Systems Science & Complexity"},{"key":"3107_CR9","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BF01457454","volume":"261","author":"A K Lenstra","year":"1982","unstructured":"Lenstra A K, Lenstra H W, and Lov\u00e1sz L, Factoring polynomials with rational coefficients, Math. Ann., 1982, 261: 513\u2013534.","journal-title":"Math. Ann."},{"key":"3107_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C P Schnorr","year":"1994","unstructured":"Schnorr C P and Euchner M, Lattice basis reduction: Improved practical algorithms and solving subset sum problems, Math. Program., 1994, 66: 181\u2013199.","journal-title":"Math. Program."},{"key":"3107_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-25385-0_1","volume":"7073","author":"Y Chen","year":"2011","unstructured":"Chen Y and Nguyen P Q, BKZ 2.0: Better lattice security estimates, ASIACRYPT 2011, 2011, 7073: 1\u201320.","journal-title":"ASIACRYPT 2011"},{"key":"3107_CR12","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/978-3-662-49890-3_30","volume":"9665","author":"Y Aono","year":"2016","unstructured":"Aono Y, Wang Y, Hayashi T, et al., Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator, EUROCRYPT 2016, 2016, 9665: 789\u2013819.","journal-title":"EUROCRYPT 2016"},{"key":"3107_CR13","volume-title":"Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Brisbane","author":"S Bai","year":"2018","unstructured":"Bai S, Stehl\u00e9 D, and Wen W, Measuring, simulating and exploiting the head concavity phenomenon in BKZ, Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, 2018."},{"key":"3107_CR14","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-13190-5_13","volume":"6110","author":"N Gama","year":"2010","unstructured":"Gama N, Nguyen P Q, and Regev O, Lattice enumeration using extreme pruning, EUROCRYPT 2010, 2010, 6110: 257\u2013278.","journal-title":"EUROCRYPT 2010"},{"key":"3107_CR15","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36494-3_14","volume":"2607","author":"C P Schnorr","year":"2003","unstructured":"Schnorr C P, Lattice reduction by random sampling and birthday methods, STACS 2003, 2003, 2607: 145\u2013156.","journal-title":"STACS 2003"},{"issue":"1","key":"3107_CR16","first-page":"67","volume":"23","author":"M Fukase","year":"2015","unstructured":"Fukase M and Kashiwabara K, An accelerated algorithm for solving SVP based on statistical analysis, JIP, 2015, 23(1): 67\u201380.","journal-title":"JIP"},{"key":"3107_CR17","unstructured":"Darmstadt\u2019s SVP Challenge, https:\/\/www.latticechallenge.org\/svp-challenge\/index.php."},{"key":"3107_CR18","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-56614-6_3","volume":"10211","author":"Y Aono","year":"2017","unstructured":"Aono Y and Nguyen P Q, Random sampling revisited: Lattice enumeration with discrete pruning, EUROCRYPT 2017, 2017, 10211: 65\u2013102.","journal-title":"EUROCRYPT 2017"},{"key":"3107_CR19","unstructured":"Darmstadt\u2019s Lattice Challenge, http:\/\/www.latticechallenge.org\/."},{"key":"3107_CR20","volume-title":"PQC 2009","author":"D Micciancio","year":"2009","unstructured":"Micciancio D and Regev O, Lattice-based cryptography, PQC 2009, Springer, Berlin\/Heidelberg, 2009."},{"key":"3107_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-78967-3_3","volume":"4965","author":"N Gama","year":"2008","unstructured":"Gama N and Nguyen P Q, Predicting lattice reduction, EUROCRYPT 2008, 2008, 4965: 31\u201351.","journal-title":"EUROCRYPT 2008"},{"key":"3107_CR22","volume-title":"Doctor Degree Thesis","author":"Y Chen","year":"2013","unstructured":"Chen Y, R\u00e9duction de r\u00e9seau et s\u00e9curit\u00e9 concr\u00e9te du chiffrement compl\u00e9tement homomorphe, Doctor Degree Thesis, 2013."},{"issue":"^3","key":"3107_CR23","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1112\/plms\/s3-6.2.305","volume":"6","author":"C A Rogers","year":"1956","unstructured":"Rogers C A, The number of lattice points in a set, Proc. London Math. Soc., 1956, 63): 305\u2013320.","journal-title":"Proc. London Math. Soc."},{"key":"3107_CR24","first-page":"3","volume":"10719","author":"Y Yu","year":"2017","unstructured":"Yu Y and Ducas L, Second order statistical behavior of LLL and BKZ, SAC 2017, 2017, 10719: 3\u201322.","journal-title":"SAC 2017"},{"key":"3107_CR25","unstructured":"NTL Library Homepage, http:\/\/shoup.net\/ntl\/."},{"key":"3107_CR26","unstructured":"Progressive BKZ Library Homepage, https:\/\/www2.nict.go.jp\/security\/pbkzcode\/."},{"key":"3107_CR27","first-page":"79","volume":"5299","author":"J Buchmann","year":"2008","unstructured":"Buchmann J, Lindner R, and R\u00fcckert M, Explicit hard instances of the shortest vector problem, PQC 2008, 2008, 5299: 79\u201394.","journal-title":"PQC 2008"},{"key":"3107_CR28","first-page":"1","volume":"1644","author":"M Ajtai","year":"1996","unstructured":"Ajtai M, Generating hard instances of lattice problems, STOC 1996, 1996, 1644: 1\u20139.","journal-title":"STOC 1996"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-023-3107-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11424-023-3107-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-023-3107-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T11:20:26Z","timestamp":1725016826000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11424-023-3107-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,25]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["3107"],"URL":"https:\/\/doi.org\/10.1007\/s11424-023-3107-7","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"type":"print","value":"1009-6124"},{"type":"electronic","value":"1559-7067"}],"subject":[],"published":{"date-parts":[[2023,10,25]]},"assertion":[{"value":"23 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}