{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:23:27Z","timestamp":1740169407129,"version":"3.37.3"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3469368","type":"journal-article","created":{"date-parts":[[2024,9,27]],"date-time":"2024-09-27T18:37:34Z","timestamp":1727462254000},"page":"141026-141031","source":"Crossref","is-referenced-by-count":0,"title":["A Novel Approximation Algorithm for the Shortest Vector Problem"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3995-1826","authenticated-orcid":false,"given":"K. B.","family":"Ajitha Shenoy","sequence":"first","affiliation":[{"name":"Department of Information and Communication Technology, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal, Karnataka, India"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139012843.017"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1201\/b11066"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-33386-6_10"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-72565-9_1"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11401-023-0053-6"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96247-4_2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00138"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/EIConRus49466.2020.9038920"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3076598"},{"key":"ref10","first-page":"1","article-title":"2-D information encoding for lattice-based encryption scheme using entropy approach for futuristic applications","volume-title":"Proc. IEEE 9th Int. Conf. Converg. Technol. (I CT)","author":"Chandu"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2013.072513.121479"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2967047"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISCTURKEY51113.2020.9307966"},{"article-title":"Another NP-complete problem and the complexity of computing short vectors in a lattice","year":"1981","author":"Boas","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276705"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700373039"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02295-1_2"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-019-00634-9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581144"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_3"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_1"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3493492.3493498"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89339-6_10"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380857"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3586165.3586172"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.31"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743432"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.1999.766277"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3031276"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2876401"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2759281"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICACI49185.2020.9177756"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.3043499"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/SC41405.2020.00064"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/SYNASC57785.2022.00025"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.23919\/EUSIPCO.2019.8902635"},{"article-title":"An introduction to Lenstra-Lenstra-Lovasz lattice basis reduction algorithm","year":"2016","author":"Deng","key":"ref38"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10380310\/10697125.pdf?arnumber=10697125","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T15:05:40Z","timestamp":1728572740000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10697125\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3469368","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2024]]}}}