{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T01:04:56Z","timestamp":1772240696106,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T00:00:00Z","timestamp":1688947200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272362, U19B2021"],"award-info":[{"award-number":["62272362, U19B2021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP21K11751"],"award-info":[{"award-number":["JP21K11751"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["202006960055"],"award-info":[{"award-number":["202006960055"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,10]]},"DOI":"10.1145\/3579856.3595802","type":"proceedings-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T14:52:13Z","timestamp":1688568733000},"page":"664-677","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["A Trade-off SVP-solving Strategy based on a Sharper pnj-BKZ Simulator"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9831-4937","authenticated-orcid":false,"given":"Leizhang","family":"Wang","sequence":"first","affiliation":[{"name":"State Key Laboratory of Integrated Service Networks, Xidian University, China and Graduate School of Engineering, Osaka University, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2872-4508","authenticated-orcid":false,"given":"Yuntao","family":"Wang","sequence":"additional","affiliation":[{"name":"Graduate School of Engineering, Osaka University, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2554-4464","authenticated-orcid":false,"given":"Baocang","family":"Wang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Service Networks, Xidian University, China"}]}],"member":"320","published-online":{"date-parts":[[2023,7,10]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"US Department of Commerce","year":"2020","unstructured":"2020. US Department of Commerce , National Institute of Standards and Technology . Post-Quantum Cryptography. ( 2020 ). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/. 2020. US Department of Commerce, National Institute of Standards and Technology. Post-Quantum Cryptography. (2020). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/."},{"key":"e_1_3_2_1_2_1","unstructured":"2022. PQC Standardization Process: Fourth Round Candidate Announcement. (2022). https:\/\/csrc.nist.gov\/News\/2022\/pqc-candidates-to-be-standardized-and-round-4.  2022. PQC Standardization Process: Fourth Round Candidate Announcement. (2022). https:\/\/csrc.nist.gov\/News\/2022\/pqc-candidates-to-be-standardized-and-round-4."},{"key":"e_1_3_2_1_3_1","volume-title":"IACR Cryptology ePrint. IACR Cryptology ePrint Archive","author":"Becker","year":"2015","unstructured":"Becker A., Gama N., and Joux A . 2015. Speeding-up lattice sieving without increasing the memory, using sub-quadratic nearest neighbor search . In IACR Cryptology ePrint. IACR Cryptology ePrint Archive , 2015 \/522. https:\/\/eprint.iacr.org\/2015\/522 Becker A., Gama N., and Joux A.2015. Speeding-up lattice sieving without increasing the memory, using sub-quadratic nearest neighbor search. In IACR Cryptology ePrint. IACR Cryptology ePrint Archive, 2015\/522. https:\/\/eprint.iacr.org\/2015\/522"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing(STOC \u201901)","author":"Ajtai Mikl\u00f3s","unstructured":"Mikl\u00f3s Ajtai , Ravi Kumar , and D. Sivakumar . 2001. A Sieve Algorithm for the Shortest Lattice Vector Problem . In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing(STOC \u201901) . Association for Computing Machinery, New York, NY, USA, 601\u2013610. https:\/\/doi.org\/10.1145\/380752.380857 10.1145\/380752.380857 Mikl\u00f3s Ajtai, Ravi Kumar, and D. Sivakumar. 2001. A Sieve Algorithm for the Shortest Lattice Vector Problem. In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing(STOC \u201901). Association for Computing Machinery, New York, NY, USA, 601\u2013610. https:\/\/doi.org\/10.1145\/380752.380857"},{"key":"e_1_3_2_1_5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT","author":"Albrecht R.","year":"2019","unstructured":"Martin\u00a0 R. Albrecht , L\u00e9o Ducas , Gottfried Herold , Elena Kirshanova , Eamonn\u00a0 W. Postlethwaite , and Marc Stevens . 2019. The General Sieve Kernel and New Records in Lattice Reduction . In Advances in Cryptology \u2013 EUROCRYPT 2019 , Yuval Ishai and Vincent Rijmen (Eds.). Springer International Publishing , Cham, 717\u2013746. https:\/\/doi.org\/10.1007\/978-3-030-17656-3_25 10.1007\/978-3-030-17656-3_25 Martin\u00a0R. Albrecht, L\u00e9o Ducas, Gottfried Herold, Elena Kirshanova, Eamonn\u00a0W. Postlethwaite, and Marc Stevens. 2019. The General Sieve Kernel and New Records in Lattice Reduction. In Advances in Cryptology \u2013 EUROCRYPT 2019, Yuval Ishai and Vincent Rijmen (Eds.). Springer International Publishing, Cham, 717\u2013746. https:\/\/doi.org\/10.1007\/978-3-030-17656-3_25"},{"key":"e_1_3_2_1_6_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT","author":"Albrecht R.","year":"2017","unstructured":"Martin\u00a0 R. Albrecht , Florian G\u00f6pfert , Fernando Virdia , and Thomas Wunderer . 2017. Revisiting the Expected Cost of Solving uSVP and Applications to LWE . In Advances in Cryptology \u2013 ASIACRYPT 2017 , Tsuyoshi Takagi and Thomas Peyrin (Eds.). Springer International Publishing , Cham, 297\u2013322. https:\/\/doi.org\/10.1007\/978-3-319-70694-8_11 10.1007\/978-3-319-70694-8_11 Martin\u00a0R. Albrecht, Florian G\u00f6pfert, Fernando Virdia, and Thomas Wunderer. 2017. Revisiting the Expected Cost of Solving uSVP and Applications to LWE. In Advances in Cryptology \u2013 ASIACRYPT 2017, Tsuyoshi Takagi and Thomas Peyrin (Eds.). Springer International Publishing, Cham, 297\u2013322. https:\/\/doi.org\/10.1007\/978-3-319-70694-8_11"},{"key":"e_1_3_2_1_7_1","volume-title":"25th USENIX Security Symposium (USENIX Security 16)","author":"Alkim Erdem","year":"2016","unstructured":"Erdem Alkim , L\u00e9o Ducas , Thomas P\u00f6ppelmann , and Peter Schwabe . 2016 . Post-quantum Key Exchange\u2014A New Hope . In 25th USENIX Security Symposium (USENIX Security 16) . USENIX Association, Austin, TX, 327\u2013343. https:\/\/www.usenix.org\/conference\/usenixsecurity16\/technical-sessions\/presentation\/alkim Erdem Alkim, L\u00e9o Ducas, Thomas P\u00f6ppelmann, and Peter Schwabe. 2016. Post-quantum Key Exchange\u2014A New Hope. In 25th USENIX Security Symposium (USENIX Security 16). USENIX Association, Austin, TX, 327\u2013343. https:\/\/www.usenix.org\/conference\/usenixsecurity16\/technical-sessions\/presentation\/alkim"},{"key":"e_1_3_2_1_8_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT","author":"Aono Yoshinori","year":"2016","unstructured":"Yoshinori Aono , Yuntao Wang , Takuya Hayashi , and Tsuyoshi Takagi . 2016. Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator . In Advances in Cryptology \u2013 EUROCRYPT 2016 , Marc Fischlin and Jean-S\u00e9bastien Coron (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg, 789\u2013819. https:\/\/doi.org\/10.1007\/978-3-662-49890-3_30 10.1007\/978-3-662-49890-3_30 Yoshinori Aono, Yuntao Wang, Takuya Hayashi, and Tsuyoshi Takagi. 2016. Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator. In Advances in Cryptology \u2013 EUROCRYPT 2016, Marc Fischlin and Jean-S\u00e9bastien Coron (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 789\u2013819. https:\/\/doi.org\/10.1007\/978-3-662-49890-3_30"},{"key":"e_1_3_2_1_9_1","volume-title":"A","author":"Bai Shi","year":"2016","unstructured":"Shi Bai , Thijs Laarhoven , and Damien Stehl\u00e9 . 2016. Tuple lattice sieving. LMS Journal of Computation and Mathematics 19 , A ( 2016 ), 146\u2013162. https:\/\/doi.org\/10.1112\/S1461157016000292 10.1112\/S1461157016000292 Shi Bai, Thijs Laarhoven, and Damien Stehl\u00e9. 2016. Tuple lattice sieving. LMS Journal of Computation and Mathematics 19, A (2016), 146\u2013162. https:\/\/doi.org\/10.1112\/S1461157016000292"},{"key":"e_1_3_2_1_10_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT","author":"Bai Shi","year":"2018","unstructured":"Shi Bai , Damien Stehl\u00e9 , and Weiqiang Wen . 2018. Measuring , Simulating and Exploiting the Head Concavity Phenomenon in BKZ . In Advances in Cryptology \u2013 ASIACRYPT 2018 , Thomas Peyrin and Steven Galbraith (Eds.). Springer International Publishing , Cham, 369\u2013404. https:\/\/doi.org\/10.1007\/978-3-030-03326-2_13 10.1007\/978-3-030-03326-2_13 Shi Bai, Damien Stehl\u00e9, and Weiqiang Wen. 2018. Measuring, Simulating and Exploiting the Head Concavity Phenomenon in BKZ. In Advances in Cryptology \u2013 ASIACRYPT 2018, Thomas Peyrin and Steven Galbraith (Eds.). Springer International Publishing, Cham, 369\u2013404. https:\/\/doi.org\/10.1007\/978-3-030-03326-2_13"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884437"},{"key":"e_1_3_2_1_13_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT","author":"Chen Yuanmi","year":"2011","unstructured":"Yuanmi Chen and Phong\u00a0 Q. Nguyen . 2011. BKZ 2.0 : Better Lattice Security Estimates . In Advances in Cryptology \u2013 ASIACRYPT 2011 , Dong\u00a0Hoon Lee and Xiaoyun Wang (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg, 1\u201320. https:\/\/doi.org\/10.1007\/978-3-642-25385-0_1 10.1007\/978-3-642-25385-0_1 Yuanmi Chen and Phong\u00a0Q. Nguyen. 2011. BKZ 2.0: Better Lattice Security Estimates. In Advances in Cryptology \u2013 ASIACRYPT 2011, Dong\u00a0Hoon Lee and Xiaoyun Wang (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 1\u201320. https:\/\/doi.org\/10.1007\/978-3-642-25385-0_1"},{"key":"e_1_3_2_1_14_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT","author":"Ducas L\u00e9o","year":"2018","unstructured":"L\u00e9o Ducas . 2018. Shortest Vector from Lattice Sieving: A Few Dimensions for Free . In Advances in Cryptology \u2013 EUROCRYPT 2018 , Jesper\u00a0Buus Nielsen and Vincent Rijmen (Eds.). Springer International Publishing , Cham, 125\u2013145. https:\/\/doi.org\/10.1007\/978-3-319-78381-9_5 10.1007\/978-3-319-78381-9_5 L\u00e9o Ducas. 2018. Shortest Vector from Lattice Sieving: A Few Dimensions for Free. In Advances in Cryptology \u2013 EUROCRYPT 2018, Jesper\u00a0Buus Nielsen and Vincent Rijmen (Eds.). Springer International Publishing, Cham, 125\u2013145. https:\/\/doi.org\/10.1007\/978-3-319-78381-9_5"},{"key":"e_1_3_2_1_15_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT","author":"Gama Nicolas","year":"2008","unstructured":"Nicolas Gama and Phong\u00a0 Q. Nguyen . 2008. Predicting Lattice Reduction . In Advances in Cryptology \u2013 EUROCRYPT 2008 , Nigel Smart (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg, 31\u201351. https:\/\/doi.org\/10.1007\/978-3-540-78967-3_3 10.1007\/978-3-540-78967-3_3 Nicolas Gama and Phong\u00a0Q. Nguyen. 2008. Predicting Lattice Reduction. In Advances in Cryptology \u2013 EUROCRYPT 2008, Nigel Smart (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 31\u201351. https:\/\/doi.org\/10.1007\/978-3-540-78967-3_3"},{"key":"e_1_3_2_1_16_1","volume-title":"Public-Key Cryptography \u2013 PKC","author":"Herold Gottfried","year":"2017","unstructured":"Gottfried Herold and Elena Kirshanova . 2017. Improved Algorithms for the Approximate k-List Problem in Euclidean Norm . In Public-Key Cryptography \u2013 PKC 2017 , Serge Fehr (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg, 16\u201340. https:\/\/doi.org\/10.1007\/978-3-662-54365-8_2 10.1007\/978-3-662-54365-8_2 Gottfried Herold and Elena Kirshanova. 2017. Improved Algorithms for the Approximate k-List Problem in Euclidean Norm. In Public-Key Cryptography \u2013 PKC 2017, Serge Fehr (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 16\u201340. https:\/\/doi.org\/10.1007\/978-3-662-54365-8_2"},{"key":"e_1_3_2_1_17_1","volume-title":"Public-Key Cryptography \u2013 PKC","author":"Herold Gottfried","year":"2018","unstructured":"Gottfried Herold , Elena Kirshanova , and Thijs Laarhoven . 2018. Speed-Ups and Time\u2013Memory Trade-Offs for Tuple Lattice Sieving . In Public-Key Cryptography \u2013 PKC 2018 , Michel Abdalla and Ricardo Dahab (Eds.). Springer International Publishing , Cham, 407\u2013436. https:\/\/doi.org\/10.1007\/978-3-319-76578-5_14 10.1007\/978-3-319-76578-5_14 Gottfried Herold, Elena Kirshanova, and Thijs Laarhoven. 2018. Speed-Ups and Time\u2013Memory Trade-Offs for Tuple Lattice Sieving. In Public-Key Cryptography \u2013 PKC 2018, Michel Abdalla and Ricardo Dahab (Eds.). Springer International Publishing, Cham, 407\u2013436. https:\/\/doi.org\/10.1007\/978-3-319-76578-5_14"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.3.415"},{"key":"e_1_3_2_1_19_1","volume-title":"Progressive Lattice Sieving","author":"Laarhoven Thijs","unstructured":"Thijs Laarhoven and Artur Mariano . 2018. Progressive Lattice Sieving . In Post-Quantum Cryptography, Tanja Lange and Rainer Steinwandt (Eds.). Springer International Publishing , Cham , 292\u2013311. https:\/\/doi.org\/10.1007\/978-3-319-79063-3_14 10.1007\/978-3-319-79063-3_14 Thijs Laarhoven and Artur Mariano. 2018. Progressive Lattice Sieving. In Post-Quantum Cryptography, Tanja Lange and Rainer Steinwandt (Eds.). Springer International Publishing, Cham, 292\u2013311. https:\/\/doi.org\/10.1007\/978-3-319-79063-3_14"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873720"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1515\/JMC.2008.009"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581144"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"e_1_3_2_1_25_1","first-page":"468","article-title":"Improved Pump and Jump BKZ by Sharp Simulator","volume":"2022","author":"Wang Leizhang","year":"2022","unstructured":"Leizhang Wang , Wenwen Xia , Geng Wang , Baocang Wang , and Dawu Gu . 2022 . Improved Pump and Jump BKZ by Sharp Simulator . IACR Cryptol. ePrint Arch. 2022 (2022), 468 . https:\/\/ia.cr\/2022\/468 Leizhang Wang, Wenwen Xia, Geng Wang, Baocang Wang, and Dawu Gu. 2022. Improved Pump and Jump BKZ by Sharp Simulator. IACR Cryptol. ePrint Arch. 2022 (2022), 468. https:\/\/ia.cr\/2022\/468","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_26_1","volume-title":"19th International Conference, ICICS 2017, Beijing, China, December 6-8, 2017, Proceedings. 541\u2013553","author":"Wang Yuntao","year":"2017","unstructured":"Yuntao Wang , Yoshinori Aono , and Tsuyoshi Takagi . 2017 . An Experimental Study of Kannan\u2019s Embedding Technique for the Search LWE Problem. In Information and Communications Security - 19th International Conference, ICICS 2017, Beijing, China, December 6-8, 2017, Proceedings. 541\u2013553 . https:\/\/doi.org\/10.1007\/978-3-319-89500-0_47 10.1007\/978-3-319-89500-0_47 Yuntao Wang, Yoshinori Aono, and Tsuyoshi Takagi. 2017. An Experimental Study of Kannan\u2019s Embedding Technique for the Search LWE Problem. In Information and Communications Security - 19th International Conference, ICICS 2017, Beijing, China, December 6-8, 2017, Proceedings. 541\u2013553. https:\/\/doi.org\/10.1007\/978-3-319-89500-0_47"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-020-00501-y"},{"key":"e_1_3_2_1_28_1","first-page":"1343","article-title":"Improved Progressive BKZ with Lattice Sieving","volume":"2022","author":"Xia Wenwen","year":"2022","unstructured":"Wenwen Xia , Leizhang Wang , GengWang, Dawu Gu , and Baocang Wang . 2022 . Improved Progressive BKZ with Lattice Sieving . IACR Cryptol. ePrint Arch. 2022 (2022), 1343 . https:\/\/ia.cr\/2022\/1343 Wenwen Xia, Leizhang Wang, GengWang, Dawu Gu, and Baocang Wang. 2022. Improved Progressive BKZ with Lattice Sieving. IACR Cryptol. ePrint Arch. 2022 (2022), 1343. https:\/\/ia.cr\/2022\/1343","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1049\/ise2.12083","article-title":"Improved lattice enumeration algorithms by primal and dual reordering methods","volume":"17","author":"Yamamura Kazuki","year":"2022","unstructured":"Kazuki Yamamura , Yuntao Wang , and Eiichiro Fujisaki . 2022 . Improved lattice enumeration algorithms by primal and dual reordering methods . IET Information Security 17 (2022), 35 \u2013 45 . Issue 1. https:\/\/doi.org\/10.1049\/ise2.12083 10.1049\/ise2.12083 Kazuki Yamamura, Yuntao Wang, and Eiichiro Fujisaki. 2022. Improved lattice enumeration algorithms by primal and dual reordering methods. IET Information Security 17 (2022), 35\u201345. Issue 1. https:\/\/doi.org\/10.1049\/ise2.12083","journal-title":"IET Information Security"}],"event":{"name":"ASIA CCS '23: ACM ASIA Conference on Computer and Communications Security","location":"Melbourne VIC Australia","acronym":"ASIA CCS '23","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579856.3595802","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:08:17Z","timestamp":1750183697000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579856.3595802"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,10]]},"references-count":28,"alternative-id":["10.1145\/3579856.3595802","10.1145\/3579856"],"URL":"https:\/\/doi.org\/10.1145\/3579856.3595802","relation":{},"subject":[],"published":{"date-parts":[[2023,7,10]]},"assertion":[{"value":"2023-07-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}