{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:28:26Z","timestamp":1750220906308,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T00:00:00Z","timestamp":1578614400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,1,10]]},"DOI":"10.1145\/3377644.3377649","type":"proceedings-article","created":{"date-parts":[[2020,2,26]],"date-time":"2020-02-26T08:16:17Z","timestamp":1582704977000},"page":"1-5","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Block Sieve Reduction"],"prefix":"10.1145","author":[{"given":"Zedong","family":"Sun","sequence":"first","affiliation":[{"name":"Henan Key Laboratory of Network, Cryptography Technology, Zhengzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunxiang","family":"Gu","sequence":"additional","affiliation":[{"name":"Henan Key Laboratory of Network, Cryptography Technology, Zhengzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yonghui","family":"Zheng","sequence":"additional","affiliation":[{"name":"Henan Key Laboratory of Network, Cryptography Technology, Zhengzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,2,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature23461"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808749"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1985-0777278-8"},{"volume-title":"29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30-June 3, 2010. Proceedings. Springer-Verlag.","author":"Gama N.","key":"e_1_3_2_1_6_1","unstructured":"Gama , N. , Nguyen , P. Q. , and Regev , O . 2010. Lattice Enumeration Using Extreme Pruning. Advances in Cryptology - EUROCRYPT 2010 , 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30-June 3, 2010. Proceedings. Springer-Verlag. Gama, N., Nguyen, P. Q., and Regev, O. 2010. Lattice Enumeration Using Extreme Pruning. Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30-June 3, 2010. Proceedings. Springer-Verlag."},{"key":"e_1_3_2_1_7_1","unstructured":"Kumar R. and Sivakumar D. 2001. A Sieve Algorithm for the Shortest Lattice Vector Problem.  Kumar R. and Sivakumar D. 2001. A Sieve Algorithm for the Shortest Lattice Vector Problem."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1515\/JMC.2008.009"},{"volume-title":"Acm-siam Symposium on Discrete Algorithms.","author":"Micciancio D.","key":"e_1_3_2_1_9_1","unstructured":"Micciancio , D. , and Voulgaris , P . 2010. Faster exponential time algorithms for the shortest vector problem . Acm-siam Symposium on Discrete Algorithms. Micciancio, D., and Voulgaris, P. 2010. Faster exponential time algorithms for the shortest vector problem. Acm-siam Symposium on Discrete Algorithms."},{"volume-title":"Progressive Lattice Sieving. International Conference on Post-quantum Cryptography.","author":"Laarhoven T.","key":"e_1_3_2_1_10_1","unstructured":"Laarhoven , T. , and Mariano , A . 2018 . Progressive Lattice Sieving. International Conference on Post-quantum Cryptography. Laarhoven, T., and Mariano, A. 2018. Progressive Lattice Sieving. International Conference on Post-quantum Cryptography."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581144"},{"volume-title":"Acm Symposium on Theory of Computing. DBLP.","author":"Gama N.","key":"e_1_3_2_1_13_1","unstructured":"Gama , N. , and Nguyen , P. Q . 2008. Finding short lattice vectors within mordell's inequality . Acm Symposium on Theory of Computing. DBLP. Gama, N., and Nguyen, P. Q. 2008. Finding short lattice vectors within mordell's inequality. Acm Symposium on Theory of Computing. DBLP."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/070705702"},{"key":"e_1_3_2_1_15_1","unstructured":"Chen Y. and Nguyen P. Q. 2011. BKZ 2.0: Better Lattice Security Estimates. Advances in Cryptology - ASIACRYPT 2011-17th International Conference on the Theory and Application of Cryptology and Information Security Seoul South Korea December 4-8 2011. Proceedings. DBLP.  Chen Y. and Nguyen P. Q. 2011. BKZ 2.0: Better Lattice Security Estimates. Advances in Cryptology - ASIACRYPT 2011-17th International Conference on the Theory and Application of Cryptology and Information Security Seoul South Korea December 4-8 2011. Proceedings. DBLP."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-014-9918-8"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Aono Y. Wang Y. Hayashi T. and Takagi T. 2016. Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator. Advances in Cryptology - EUROCRYPT 2016. Springer Berlin Heidelberg.  Aono Y. Wang Y. Hayashi T. and Takagi T. 2016. Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator. Advances in Cryptology - EUROCRYPT 2016. Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-662-49890-3_30"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Yasuda M. and Yamaguchi J. 2019. A new polynomial-time variant of lll with deep insertions for decreasing the squared-sum of gram-schmidt lengths. Designs Codes and Cryptography.  Yasuda M. and Yamaguchi J. 2019. A new polynomial-time variant of lll with deep insertions for decreasing the squared-sum of gram-schmidt lengths. Designs Codes and Cryptography.","DOI":"10.1007\/s10623-019-00634-9"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/646517.696317"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.2197\/ipsjjip.23.67"},{"volume-title":"IACR International Workshop on Public Key Cryptography. Springer","author":"Teruya T.","key":"e_1_3_2_1_21_1","unstructured":"Teruya , T. , Kashiwabara , K. , and Hanaoka , G . 2018. Fast lattice basis reduction suitable for massive parallelization and its application to the shortest vector problem . IACR International Workshop on Public Key Cryptography. Springer , Cham , 2018: 437--460. Teruya, T., Kashiwabara, K., and Hanaoka, G. 2018. Fast lattice basis reduction suitable for massive parallelization and its application to the shortest vector problem. IACR International Workshop on Public Key Cryptography. Springer, Cham, 2018: 437--460."}],"event":{"name":"ICCSP 2020: 2020 4th International Conference on Cryptography, Security and Privacy","sponsor":["NJU Nanjing University"],"location":"Nanjing China","acronym":"ICCSP 2020"},"container-title":["Proceedings of the 2020 4th International Conference on Cryptography, Security and Privacy"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377644.3377649","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3377644.3377649","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:53Z","timestamp":1750203893000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377644.3377649"}},"subtitle":["A New Random Sampling Reduction Algorithm Based on Sieve Algorithms"],"short-title":[],"issued":{"date-parts":[[2020,1,10]]},"references-count":21,"alternative-id":["10.1145\/3377644.3377649","10.1145\/3377644"],"URL":"https:\/\/doi.org\/10.1145\/3377644.3377649","relation":{},"subject":[],"published":{"date-parts":[[2020,1,10]]},"assertion":[{"value":"2020-02-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}