{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:58:21Z","timestamp":1773377901217,"version":"3.50.1"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518190","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2405-2410","source":"Crossref","is-referenced-by-count":7,"title":["On the Sample Complexity of solving LWE using BKW-Style Algorithms"],"prefix":"10.1109","author":[{"given":"Qian","family":"Guo","sequence":"first","affiliation":[{"name":"Lund University,Department of Electrical and Information Technology,Lund,Sweden"}]},{"given":"Erik","family":"M\u00e5rtensson","sequence":"additional","affiliation":[{"name":"Lund University,Department of Electrical and Information Technology,Lund,Sweden"}]},{"given":"Paul Stankovski","family":"Wagner","sequence":"additional","affiliation":[{"name":"Lund University,Department of Electrical and Information Technology,Lund,Sweden"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-65277-7_19"},{"key":"ref32","author":"budroni","year":"2020","journal-title":"FBBL - file-Based BKW for LWE"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/78.205723"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30539-2_31"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17656-3_25"},{"key":"ref34","year":"0","journal-title":"TU Darmstadt Learning with Errors Challenge"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2906233"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/11832072_24"},{"key":"ref13","article-title":"Improved generalized birthday attack","author":"kirchner","year":"2011","journal-title":"Cryptology ePrint Archive"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_35"},{"key":"ref15","article-title":"Never trust a bunny","author":"bernstein","year":"2012","journal-title":"Cryptology ePrint Archive"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45611-8_1"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-019-09338-8"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49890-3_7"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53887-6_26"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-35199-1_9"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96881-0_22"},{"key":"ref3","year":"0","journal-title":"NIST Post-Quantum Cryptography Standardization"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335355"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849218"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48329-2_24"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1515\/jmc-2015-0016","article-title":"On The Concrete Hardness Of Learning With Errors","volume":"9","author":"albrecht","year":"2015","journal-title":"J Mathematical Cryptology"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/792538.792543"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-016-0326-0"},{"key":"ref1","author":"guo","year":"2021","journal-title":"On the sample complexity of solving lwe using bkw-style algorithms"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-015-0149-2"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54631-0_25"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-013-9864-x"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47989-6_3"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47989-6_2"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63715-0_17"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_12"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518190.pdf?arnumber=9518190","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:31Z","timestamp":1773347731000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518190\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518190","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}