{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:19Z","timestamp":1773376999554,"version":"3.50.1"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"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":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195313","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":2,"title":["(Quasi-)Linear-Time Algorithms for the Closest Vector Problem in (Semi-)Equiangular Lattices"],"prefix":"10.1109","author":[{"given":"Kenta","family":"Takahashi","sequence":"first","affiliation":[{"name":"Hitachi, Ltd.,Research &#x0026; Development Group,Yokohama,Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wanaru","family":"Nakamura","sequence":"additional","affiliation":[{"name":"Hitachi, Ltd.,Research &#x0026; Development Group,Yokohama,Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"NIST releases first 3 finalized post-quantum encryption standards","volume-title":"National Institute of Standards and Technology","year":"2024"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-658-00360-9","article-title":"Lattices and Codes: A Course Partially Based on Lectures by Friedrich Hirzebruch","volume-title":"Springer","author":"Ebeling","year":"2013"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484586"},{"key":"ref4","first-page":"1559","article-title":"Facial template protection via lattice-based fuzzy extractors","volume":"2021","author":"Zhang","year":"2021","journal-title":"IACR Cryptology ePrint Archive"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2249-9","volume-title":"Sphere Packings, Lattices and Groups, 2nd ed., ser. Grundlehren der Mathematischen Wissenschaften","volume":"290","author":"Conway","year":"1993"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.771234"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834787"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2010.26"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1561\/9781680831139"},{"issue":"2","key":"ref10","article-title":"A deterministic single exponential time algorithm for SVP and CVP","volume":"60","author":"Micciancio","year":"2013","journal-title":"Journal of the ACM"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.41"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/sfcs.2003.1238203"},{"key":"ref13","first-page":"936","article-title":"Lattice sparsifier and the hardness of the closest vector problem","volume-title":"57th IEEE Symposium on Foundations of Computer Science (FOCS 2016)","author":"Dadush","year":"2016"},{"key":"ref14","first-page":"1","article-title":"Approximate CVP in time $2^{(0.802+\\varepsilon) n}$ for any norm","volume":"122","author":"Eisenbrand","year":"2021","journal-title":"Journal of Computer and System Sciences"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2039090"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/20M1382258"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595438"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173976"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05167-2"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/(sici)1097-024x(199708)27:8<983::aid-spe117>3.0.co;2-#"},{"key":"ref21","volume-title":"A linear-time algorithm for the closest vector problem of triangular lattices","author":"Takahashi","year":"2024"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195313.pdf?arnumber=11195313","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:53Z","timestamp":1773347393000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195313\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195313","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}