{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:13:48Z","timestamp":1761596028017,"version":"3.28.0"},"reference-count":36,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"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":[[2020,8]]},"DOI":"10.1109\/icaci49185.2020.9177756","type":"proceedings-article","created":{"date-parts":[[2020,8,26]],"date-time":"2020-08-26T20:43:42Z","timestamp":1598474622000},"page":"243-250","source":"Crossref","is-referenced-by-count":3,"title":["A Genetic Algorithm with Restart Strategy for Solving Approximate Shortest Vector Problem"],"prefix":"10.1109","author":[{"given":"Luan","family":"Luan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunxiang","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yonghui","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/72.265964"},{"key":"ref32","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-52156-5","volume":"679","author":"kramer","year":"2017","journal-title":"Genetic Algorithm Essentials"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CIS.2014.31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_4"},{"year":"0","key":"ref36"},{"year":"0","key":"ref35"},{"year":"0","key":"ref34"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49890-3_30"},{"key":"ref12","first-page":"142","article-title":"Explicit formula for gram-schmidt vectors in lll with deep insertions and its applications","author":"yamaguchi","year":"2017","journal-title":"International Conference on Number-Theoretic Methods in Cryptology"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03326-2_13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808749"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_13"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56614-6_3"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36494-3_14"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-76578-5_15"},{"year":"0","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.5220\/0007968800310039"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02295-1_15"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754639"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250859"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054868"},{"key":"ref29","doi-asserted-by":"crossref","DOI":"10.1201\/9781482268713","author":"b\u00e4ck","year":"2018","journal-title":"Evolutionary Computation 1 Basic Algorithms and Operators"},{"key":"ref5","first-page":"170","article-title":"Improved analysis of kannans shortest lattice vector algorithm","author":"hanrot","year":"2007","journal-title":"Annual International Cryptology Conference"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88403-3_6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-69053-0_5"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54458-5_51"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2197\/ipsjjip.23.67"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380857"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1515\/JMC.2008.009"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78381-9_5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47989-6_1"},{"key":"ref26","first-page":"51","article-title":"A simulated annealing algorithm for svp challenge through y-sparse representations of short lattice vectors","author":"ding","year":"2014","journal-title":"International Conference on Trusted Systems (INTRUST)"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-79063-3_14"}],"event":{"name":"2020 12th International Conference on Advanced Computational Intelligence (ICACI)","start":{"date-parts":[[2020,8,14]]},"location":"Dali, China","end":{"date-parts":[[2020,8,16]]}},"container-title":["2020 12th International Conference on Advanced Computational Intelligence (ICACI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9171990\/9177495\/09177756.pdf?arnumber=9177756","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T00:22:40Z","timestamp":1656375760000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9177756\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/icaci49185.2020.9177756","relation":{},"subject":[],"published":{"date-parts":[[2020,8]]}}}