{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T06:33:07Z","timestamp":1764570787145,"version":"3.37.3"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"name":"Taiwan Information Security Center"},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 105-2923-E-110-001-MY3","MOST 107-2218-E-110-014"],"award-info":[{"award-number":["MOST 105-2923-E-110-001-MY3","MOST 107-2218-E-110-014"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Information Security Research Center, National Sun Yat-sen University, Taiwan"},{"name":"Intelligent Electronic Commerce Research Center through the Featured Areas Research Center Program within the framework of the Higher Education Sprout Project by the Ministry of Education in Taiwan"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2876401","type":"journal-article","created":{"date-parts":[[2018,10,16]],"date-time":"2018-10-16T18:42:13Z","timestamp":1539715333000},"page":"61478-61487","source":"Crossref","is-referenced-by-count":11,"title":["An Efficient Algorithm for the Shortest Vector Problem"],"prefix":"10.1109","volume":"6","author":[{"given":"Yu-Lun","family":"Chuang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7512-1291","authenticated-orcid":false,"given":"Chun-I","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi-Fan","family":"Tseng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581144"},{"journal-title":"Number Theory C++ Library (NTL) Version 5 4 1","year":"2003","author":"shoup","key":"ref11"},{"key":"ref12","first-page":"31","article-title":"Predicting lattice reduction","author":"gama","year":"2008","journal-title":"Adv Cryptology"},{"key":"ref13","first-page":"257","article-title":"Lattice enumeration using extreme pruning","author":"gama","year":"2010","journal-title":"Adv Cryptology"},{"key":"ref14","first-page":"241","article-title":"Extended lattice reduction experiments using the BKZ algorithm","volume":"170","author":"schneider","year":"2010","journal-title":"Proc Sicherheit Schutz Zuverlässigkeit Beiträge 5th Jahrestagung Fachbereichs Sicherheit Gesellschaft Informatik e V (GI)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380857"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1515\/JMC.2008.009"},{"key":"ref17","first-page":"1","article-title":"BKZ 2.0: Better lattice security estimates","author":"chen","year":"2011","journal-title":"Adv Cryptology"},{"key":"ref18","first-page":"207","article-title":"Finding short lattice vectors within mordell’s inequality","author":"gama","year":"2008","journal-title":"Proc 14th Annu ACM Symp Theory Comput"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90064-8"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700373039"},{"key":"ref3","first-page":"10","article-title":"The shortest vector problem in l2 is np-hard for randomized reductions","author":"ajtai","year":"1998","journal-title":"Proc 13th Annu ACM Symp Theory Comput"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"ref5","first-page":"1","article-title":"Candidate multilinear maps from ideal lattices","volume":"7881","author":"garg","year":"2013","journal-title":"Adv Cryptology"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808749"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02295-1","article-title":"The LLL algorithm","author":"nguyen","year":"2010","journal-title":"Information Security and Cryptography"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/3-540-44670-2_12","article-title":"The two faces of lattices in cryptology","author":"nguyen","year":"2001","journal-title":"Cryptography and Lattices"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.3.415"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BFb0054868","article-title":"NTRU: A ring-based public key cryptosystem","author":"hoffstein","year":"1998","journal-title":"Algorithmic Number Theory"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.119"},{"key":"ref22","first-page":"1","article-title":"Improved Nguyen–Vidick heuristic sieve algorithm for shortest vector problem","author":"wang","year":"2011","journal-title":"Proc 6th ACM Symp Inf Comput Commun Secur"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/100811970"},{"key":"ref24","first-page":"16","article-title":"Improved algorithms for the approximate k-list problem in Euclidean norm","author":"herold","year":"2017","journal-title":"Proc IACR Int Workshop Public Key Cryptogr"},{"key":"ref23","first-page":"29","article-title":"A three-level sieve algorithm for the shortest vector problem","author":"zhang","year":"2013","journal-title":"Proc Selected Areas Cryptography"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44670-2_7"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15317-4_21"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08493462.pdf?arnumber=8493462","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T19:08:27Z","timestamp":1643224107000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8493462\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2876401","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}