{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:11:06Z","timestamp":1778249466103,"version":"3.51.4"},"reference-count":83,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772584"],"award-info":[{"award-number":["61772584"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Foundation of Science and Technology on Information Insurance Laboratory","award":["KJ-17-001"],"award-info":[{"award-number":["KJ-17-001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3031276","type":"journal-article","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T19:35:32Z","timestamp":1602790532000},"page":"190475-190486","source":"Crossref","is-referenced-by-count":5,"title":["A Review of Sieve Algorithms in Solving the Shortest Lattice Vector Problem"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1762-6301","authenticated-orcid":false,"given":"Zedong","family":"Sun","sequence":"first","affiliation":[{"name":"State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3860-1939","authenticated-orcid":false,"given":"Chunxiang","family":"Gu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yonghui","family":"Zheng","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49264-X_1"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581144"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36494-3_14"},{"key":"ref70","first-page":"458","article-title":"Sieving for shortest vectors in ideal lattices","volume":"2011","author":"schneider","year":"2011","journal-title":"IACR Cryptology ePrint"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_36"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14518-6_27"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54631-0_24"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598347011"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73951-7_4"},{"key":"ref79","first-page":"58","article-title":"Faster exponential time algorithms for the shortest vector problem","volume":"16","author":"voulgaris","year":"2009","journal-title":"Electron Colloq Comput Complex"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0052231"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374407"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011214926272"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054868"},{"key":"ref35","first-page":"407","article-title":"Speed-ups and time-memory trade-offs for tuple lattice sieving","volume":"10769","author":"herold","year":"2018","journal-title":"Public-key Cryptography"},{"key":"ref34","first-page":"16","article-title":"Improved algorithms for the approximate k-list problem in Euclidean norm","volume":"10174","author":"herold","year":"2017","journal-title":"Public-key Cryptography"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_9"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23178-0_40"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-007-0234-9"},{"key":"ref63","first-page":"417","article-title":"Use of elliptic curves in cryptography","volume":"218","author":"miller","year":"1985","journal-title":"Adv Cryptology"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_13"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-8295-8_23"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0267-z"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1515\/JMC.2008.009"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1145\/1089242.1089247"},{"key":"ref29","first-page":"10","article-title":"A public key cryptosystem and a signature scheme based on discrete logarithms","volume":"196","author":"gamal","year":"1984","journal-title":"Advances in Cryptology"},{"key":"ref67","first-page":"605","article-title":"Solving the shortest lattice vector problem in time 22.465n","volume":"2009","author":"pujol","year":"2009","journal-title":"IACR Cryptology ePrint"},{"key":"ref68","author":"regev","year":"2004","journal-title":"Lattices in Computer Science Lecture Notes"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"ref2","first-page":"10","article-title":"The shortest vector problem in L? is NP-hard for randomized reductions (extended abstract)","author":"ajtai","year":"1998","journal-title":"Proc of the 30th Annual ACM Symposium on Theory of Computing (STOC)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237838"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68339-9_14"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51938-4_15"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF01201999"},{"key":"ref24","first-page":"40","article-title":"Lattice signatures and bimodal Gaussians","volume":"8042","author":"ducas","year":"2013","journal-title":"Advances in Cryptology"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78381-9_5"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/978-3-319-16295-9_16","article-title":"Tuning Gausssieve for speed","volume":"8895","author":"fitzpatrick","year":"2014","journal-title":"Progress in Cryptology—LATINCRYPT 2014"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45388-6_1"},{"key":"ref50","first-page":"3","article-title":"Knapsack public key cryptosystems and diophantine approximation","author":"lagarias","year":"1983","journal-title":"Advances in Cryptology"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2455.2461"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/SBAC-PAD.2014.18"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2017.60"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14325-5_5"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2015.68"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71039-4_4"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_3"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55220-5_14"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.2012.0686"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808749"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1112\/S1461157014000229"},{"key":"ref13","first-page":"522","article-title":"Speeding-up lattice sieving without increasing the memory, using sub-quadratic nearest neighbor search","volume":"2015","author":"becker","year":"2015","journal-title":"IACR Cryptology ePrint"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31517-1_1"},{"key":"ref15","first-page":"1","article-title":"New attacks on RSA with small secret crt-exponents","volume":"3958","author":"bleichenbacher","year":"2006","journal-title":"Public Key Cryptography"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43414-7_2"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25405-5_8"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-52153-4_3"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/509961.509965"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_1"},{"key":"ref83","first-page":"880","article-title":"Sieving for shortest vectors in ideal lattices: A practical perspective","volume":"2014","author":"bos","year":"2014","journal-title":"IACR Cryptology ePrint"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68339-9_16"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1145\/1966913.1966915"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380857"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258604"},{"key":"ref6","first-page":"1161","article-title":"Quantum speedups for lattice sieves are tenuous at best","volume":"2019","author":"albrecht","year":"2019","journal-title":"IACR Cryptology ePrint"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17656-3_25"},{"key":"ref8","first-page":"1225","article-title":"Practical and optimal LSH for angular distance","author":"andoni","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.49"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0067-5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1112\/S1461157016000292"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.5220\/0007968800310039"},{"key":"ref45","article-title":"Faster tuple lattice sieving using spherical locality-sensitive filters","volume":"abs 1705 2828","author":"laarhoven","year":"2017","journal-title":"CoRR"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-79063-3_14"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22174-8_6"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1987-0866109-5"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34578-5_19"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47989-6_1"},{"key":"ref43","first-page":"126","article-title":"On polynomial approximation to the shortest lattice vector length","author":"kumar","year":"2001","journal-title":"Proc 12th Ann ACM\/SIAM Symp Discrete Algorithms"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09224855.pdf?arnumber=9224855","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,9]],"date-time":"2023-10-09T21:19:20Z","timestamp":1696886360000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9224855\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":83,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3031276","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}