{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T03:09:17Z","timestamp":1730344157691,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.23919\/isita.2018.8664371","type":"proceedings-article","created":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T19:49:11Z","timestamp":1552333751000},"page":"193-197","source":"Crossref","is-referenced-by-count":0,"title":["The Double-Plane Algorithm: A simple algorithm for the closest vector problem"],"prefix":"10.23919","author":[{"given":"Ferdinand","family":"Blomqvist","sequence":"first","affiliation":[]},{"given":"Marcus","family":"Greferath","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.800499"},{"year":"2016","key":"ref11","article-title":"fplll, a lattice reduction library"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2005.850352"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.41"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1515\/crll.1905.129.220","article-title":"Diskontinuitatsbereich für arithmetische äquivalenz","volume":"129","author":"minkowski","year":"1905","journal-title":"Journal fur die reine und angewandte Mathematik"},{"article-title":"An improved lower bound for approximating CVP","year":"0","author":"dinur","key":"ref4"},{"key":"ref3","first-page":"724","article-title":"The hardness of approximate optima in lattices, codes, and systems of linear equations","author":"arora","year":"1993","journal-title":"Foundations of Computer Science 1993 Proceedings 34th Annual Symposium on"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01442795"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1985-0777278-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579403"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.915688"},{"journal-title":"Another NP-complete partition problem and the complexity of computing short vectors in a lattice","year":"1981","author":"van emde boas","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581144"}],"event":{"name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","start":{"date-parts":[[2018,10,28]]},"location":"Singapore","end":{"date-parts":[[2018,10,31]]}},"container-title":["2018 International Symposium on Information Theory and Its Applications (ISITA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8660385\/8664205\/08664371.pdf?arnumber=8664371","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T01:39:19Z","timestamp":1643247559000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8664371\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":14,"URL":"https:\/\/doi.org\/10.23919\/isita.2018.8664371","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}