{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T01:38:24Z","timestamp":1701308304639},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,1,17]],"date-time":"2018-01-17T00:00:00Z","timestamp":1516147200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s11432-017-9307-0","type":"journal-article","created":{"date-parts":[[2018,5,23]],"date-time":"2018-05-23T06:59:27Z","timestamp":1527058767000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Orthogonalized lattice enumeration for solving SVP"],"prefix":"10.1007","volume":"61","author":[{"given":"Zhongxiang","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Xiaoyun","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Guangwu","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,17]]},"reference":[{"key":"9307_CR1","first-page":"601","volume-title":"A sieve algorithm for the shortest lattice vector problem","author":"M Ajtai","year":"2001","unstructured":"Ajtai M, Kumar R, Sivakumar D. A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, Hersonissos, 2001. 601\u2013610"},{"key":"9307_CR2","first-page":"193","volume-title":"Proceedings of the 15th Annual ACM Symposium on Theory of Computing","author":"R Kannan","year":"1983","unstructured":"Kannan R. Improved algorithms for integer programming and related lattice problems. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing. New York: ACM, 1983. 193\u2013206"},{"key":"9307_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1515\/JMC.2008.009","volume":"2","author":"P Q Nguyen","year":"2008","unstructured":"Nguyen P Q, Vidick T. Sieve algorithms for the shortest vector problem are practical. J Math Cryptol, 2008, 2: 181\u2013207","journal-title":"J Math Cryptol"},{"key":"9307_CR4","volume-title":"Solving the Shortest Lattice Vector Problem in Time 22.465n","author":"X Pujol","year":"2009","unstructured":"Pujol X, Stehl\u00e9 D. Solving the Shortest Lattice Vector Problem in Time 22.465n. IACR Cryptology ePrint Archive, Report 2009\/605. http:\/\/perso.ens-lyon.fr\/damien.stehle\/downloads\/2465.pdf"},{"key":"9307_CR5","first-page":"1","volume-title":"Improved Nguyen-Vidick heuristic sieve algorithm for shortest vector problem","author":"X Wang","year":"2011","unstructured":"Wang X, Liu M, Tian C, et al. Improved Nguyen-Vidick heuristic sieve algorithm for shortest vector problem. In: Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security, Hong Kong, 2011. 1\u20139"},{"key":"9307_CR6","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/100811970","volume":"42","author":"D Micciancio","year":"2013","unstructured":"Micciancio D, Voulgaris P. A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations. SIAM J Comput, 2013, 42: 1364\u20131391","journal-title":"SIAM J Comput"},{"key":"9307_CR7","first-page":"733","volume-title":"Solving the shortest vector problem in 2n time using discrete Gaussian sampling","author":"D Aggarwal","year":"2015","unstructured":"Aggarwal D, Dadush D, Regev O, et al. Solving the shortest vector problem in 2n time using discrete Gaussian sampling. In: Proceedings of the 47th Annual ACM Symposium on Theory of Computing, Portland, 2015. 733\u2013742"},{"key":"9307_CR8","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A K Lenstra","year":"1982","unstructured":"Lenstra A K, Lenstra H W, Lov\u00e1sz L. Factoring polynomials with rational coefficients. Math Ann, 1982, 261: 515\u2013534","journal-title":"Math Ann"},{"key":"9307_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C P Schnorr","year":"1994","unstructured":"Schnorr C P, Euchner M. Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math Program, 1994, 66: 181\u2013199","journal-title":"Math Program"},{"key":"9307_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(85)90067-2","volume":"41","author":"B Helfrich","year":"1985","unstructured":"Helfrich B. Algorithms to construct Minkowski reduced and Hermite reduced lattice bases. Theor Comput Sci, 1985, 41: 125\u2013139","journal-title":"Theor Comput Sci"},{"key":"9307_CR11","first-page":"170","volume-title":"Improved analysis of Kannan\u2019s shortest lattice vector algorithm","author":"G Hanrot","year":"2007","unstructured":"Hanrot G, Stehl\u00e9 D. Improved analysis of Kannan\u2019s shortest lattice vector algorithm. In: Proceedings of the 27th Annual International Cryptology Conference, Santa Barbara, 2007. 170\u2013186"},{"key":"9307_CR12","first-page":"194","volume-title":"Proceedings of the European Computer Algebra Conference on Computer Algebra","author":"U Fincke","year":"1983","unstructured":"Fincke U, Pohst M. A procedure for determining algebraic integers of given norm. In: Proceedings of the European Computer Algebra Conference on Computer Algebra. Berlin: Springer, 1983. 194\u2013202"},{"key":"9307_CR13","first-page":"257","volume-title":"Lattice enumeration using extreme pruning","author":"N Gama","year":"2010","unstructured":"Gama N, Nguyen P Q, Regev O. Lattice enumeration using extreme pruning. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco and Nice, 2010. 257\u2013278"},{"key":"9307_CR14","unstructured":"Shoup V. Number theory c++ library (ntl). http:\/\/www.shoup.net\/ntl\/"},{"key":"9307_CR15","first-page":"319","volume-title":"Better key sizes (and attacks) for LWE-based encryption","author":"R Lindner","year":"2011","unstructured":"Lindner R, Peikert C. Better key sizes (and attacks) for LWE-based encryption. In: Proceedings of Cryptographers\u2019 Track at the RSA Conference, San Francisco, 2011. 319\u2013339"},{"key":"9307_CR16","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-88702-7_5","volume-title":"Post-Quantum Cryptography","author":"D Micciancio","year":"2009","unstructured":"Micciancio D, Regev O. Lattice-based cryptography. In: Post-Quantum Cryptography. Berlin: Springer, 2009. 147\u2013191"},{"key":"9307_CR17","volume-title":"Estimating the Security of Lattice-based Cryptosystems","author":"M R\u00fcckert","year":"2010","unstructured":"R\u00fcckert M, Schneider M. Estimating the Security of Lattice-based Cryptosystems. IACR Cryptology ePrint Archive, Report 2010\/137. https:\/\/pdfs.semanticscholar.org\/72de\/2153c2f5fbe5769a739dfe7a4eb7cc9271de.pdf"},{"key":"9307_CR18","first-page":"1","volume-title":"Attacking the Chor-Rivest cryptosystem by improved lattice reduction","author":"C P Schnorr","year":"1995","unstructured":"Schnorr C P, H\u00f6rner H H. Attacking the Chor-Rivest cryptosystem by improved lattice reduction. In: Proceedings of the 14th Annual International Conference on Theory and Application of Cryptographic Techniques, Saint-Malo, 1995. 1\u201312"},{"key":"9307_CR19","first-page":"73","volume-title":"Analysing progressive-BKZ lattice reduction algorithm","author":"M Haque","year":"2013","unstructured":"Haque M, Rahman M O, Pieprzyk J. Analysing progressive-BKZ lattice reduction algorithm. In: Proceedings of the 1st National Conference on Intelligent Computing and Information Technology, Chittagong, 2013. 73\u201380"},{"key":"9307_CR20","first-page":"176","volume-title":"Extreme enumeration on GPU and in clouds","author":"P C Kuo","year":"2011","unstructured":"Kuo P C, Schneider M, Dagdelen \u00d6, et al. Extreme enumeration on GPU and in clouds. In: Proceedings of the 13th International Workshop on Cryptographic Hardware and Embedded Systems, Nara, 2011. 176\u2013191"},{"key":"9307_CR21","first-page":"1","volume-title":"BKZ 2.0: better lattice security estimates","author":"Y M Chen","year":"2011","unstructured":"Chen Y M, Nguyen P Q. BKZ 2.0: better lattice security estimates. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security, Seoul, 2011. 1\u201320"},{"key":"9307_CR22","first-page":"789","volume-title":"Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator","author":"Y Aono","year":"2016","unstructured":"Aono Y, Wang Y T, Hayashi T, et al. Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, 2016. 789\u2013819"},{"key":"9307_CR23","first-page":"820","volume-title":"Practical, predictable lattice basis reduction","author":"D Micciancio","year":"2016","unstructured":"Micciancio D, Walter M. Practical, predictable lattice basis reduction. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, 2016. 820\u2013849"},{"key":"9307_CR24","first-page":"145","volume-title":"Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science","author":"C P Schnorr","year":"2003","unstructured":"Schnorr C P. Lattice reduction by random sampling and birthday methods. In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science. Berlin: Springer, 2003. 145\u2013156"},{"key":"9307_CR25","first-page":"823","volume-title":"A genetic algorithm for searching the shortest lattice vector of SVP challenge","author":"D Ding","year":"2015","unstructured":"Ding D, Zhu G Z, Wang X Y. A genetic algorithm for searching the shortest lattice vector of SVP challenge. In: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, Madrid, 2015, 823\u2013830"},{"key":"9307_CR26","first-page":"67","volume":"23","author":"M Fukase","year":"2015","unstructured":"Fukase M, Kashiwabara K. An accelerated algorithm for solving SVP based on statistical analysis. J Inf Process, 2015, 23: 67\u201380","journal-title":"J Inf Process"},{"key":"9307_CR27","volume-title":"Adaptation in Natural and Artificial Systems","author":"J H Holland","year":"1975","unstructured":"Holland J H. Adaptation in Natural and Artificial Systems. Ann Arbor: The University of Michigan Press, 1975"},{"key":"9307_CR28","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0004-3702(89)90050-7","volume":"40","author":"L B Booker","year":"1989","unstructured":"Booker L B, Goldberg D E, Holland J H. Classifier systems and genetic algorithms. Artif Intell, 1989, 40: 235\u2013282","journal-title":"Artif Intell"},{"key":"9307_CR29","first-page":"4","volume-title":"Global convergence of genetic algorithms: a Markov chain analysis","author":"A E Eiben","year":"1990","unstructured":"Eiben A E, Aarts E H, Van Hee K M. Global convergence of genetic algorithms: a Markov chain analysis. In: Proceedings of International Conference on Parallel Problem Solving from Nature, Dortmund, 1990. 4\u201312"},{"key":"9307_CR30","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1023\/A:1022602019183","volume":"3","author":"D E Goldberg","year":"1988","unstructured":"Goldberg D E, Holland J H. Genetic algorithms and machine learning. Mach Learn, 1988, 3: 95\u201399","journal-title":"Mach Learn"},{"key":"9307_CR31","unstructured":"Schneider M, Gama N. SVP CHALLENGE. http:\/\/www.latticechallenge.org\/svp-challenge\/"},{"key":"9307_CR32","unstructured":"Aono Y, Wang Y, Hayashi T, et al. Progressive BKZ library. http:\/\/www2.nict.go.jp\/security\/pbkzcode\/index.html"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-017-9307-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-017-9307-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-017-9307-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T01:25:03Z","timestamp":1547688303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-017-9307-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,17]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["9307"],"URL":"https:\/\/doi.org\/10.1007\/s11432-017-9307-0","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,17]]},"assertion":[{"value":"6 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"032115"}}