{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T10:36:39Z","timestamp":1764239799291},"publisher-location":"Berlin, Heidelberg","reference-count":60,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642386152"},{"type":"electronic","value":"9783642386169"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38616-9_6","type":"book-chapter","created":{"date-parts":[[2013,6,4]],"date-time":"2013-06-04T07:55:16Z","timestamp":1370332516000},"page":"83-101","source":"Crossref","is-referenced-by-count":13,"title":["Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search"],"prefix":"10.1007","author":[{"given":"Thijs","family":"Laarhoven","sequence":"first","affiliation":[]},{"given":"Michele","family":"Mosca","sequence":"additional","affiliation":[]},{"given":"Joop","family":"van de Pol","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","first-page":"210","volume-title":"44th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"D. Aharonov","year":"2003","unstructured":"Aharonov, D., Regev, O.: A Lattice Problem in Quantum NP. In: 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 210\u2013219. IEEE Press, New York (2003)"},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/276698.276705","volume-title":"30th Annual ACM Symposium on Theory of Computing (STOC)","author":"M. Ajtai","year":"1998","unstructured":"Ajtai, M.: The Shortest Vector Problem in L 2 is NP-hard for Randomized Reductions. In: 30th Annual ACM Symposium on Theory of Computing (STOC), pp. 10\u201319. ACM, New York (1998)"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1145\/380752.380857","volume-title":"33rd Annual ACM Symposium on Theory of Computing (STOC)","author":"M. Ajtai","year":"2001","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A Sieve Algorithm for the Shortest Lattice Vector Problem. In: 33rd Annual ACM Symposium on Theory of Computing (STOC), pp. 601\u2013610. ACM, New York (2001)"},{"key":"6_CR4","first-page":"22","volume-title":"45th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"A. Ambainis","year":"2003","unstructured":"Ambainis, A.: Quantum Walk Algorithm for Element Distinctness. In: 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 22\u201331. IEEE Press, New York (2003)"},{"issue":"211","key":"6_CR5","first-page":"15","volume":"112","author":"Y. Aono","year":"2012","unstructured":"Aono, Y., Naganuma, K.: Heuristic Improvements of BKZ 2.0. IEICE Tech. Rep.\u00a0112(211), 15\u201322 (2012)","journal-title":"IEICE Tech. Rep."},{"issue":"5","key":"6_CR6","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"C.H. Bennett","year":"1997","unstructured":"Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, V.: Strengths and Weaknesses of Quantum Computing. SIAM J. Comput.\u00a026(5), 1510\u20131523 (1997)","journal-title":"SIAM J. Comput."},{"key":"6_CR7","unstructured":"Bernstein, D.J.: Cost analysis of hash collisions: Will quantum computers make SHARCs obsolete? In: SHARCS 2009: Special-purpose Hardware for Attacking Cryptographic Systems (2009)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Post-Quantum Cryptography","year":"2008","unstructured":"Buchmann, J., Ding, J. (eds.): PQCrypto 2008. LNCS, vol.\u00a05299. Springer, Heidelberg (2008)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M. Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight Bounds on Quantum Searching. Fortschritte der Physik\u00a046, 493\u2013505 (1998)","journal-title":"Fortschritte der Physik"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: Fully homomorphic encryption without bootstrapping. In: Goldwasser, S. (ed.) Innovations in Theoretical Computer Science, ITCS 2012, pp. 309\u2013325. ACM (2012)","DOI":"10.1145\/2090236.2090262"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BFb0054319","volume-title":"LATIN\u201998: Theoretical Informatics","author":"G. Brassard","year":"1998","unstructured":"Brassard, G., H\u00f8yer, P., Tapp, A.: Quantum cryptanalysis of hash and claw-free functions. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol.\u00a01380, pp. 163\u2013169. Springer, Heidelberg (1998)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Brassard, G., H\u00f8yer, P., Mosca, M., Tapp, A.: Quantum Amplitude Amplification and Estimation. AMS Contemporary Mathematics Series Millennium Vol. entitled Quantum Computation & Information, vol.\u00a0305 (2002)","DOI":"10.1090\/conm\/305\/05215"},{"issue":"6","key":"6_CR13","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1137\/S0097539702402780","volume":"34","author":"B. Buhrman","year":"2005","unstructured":"Buhrman, B., D\u00fcrr, C., Heiligman, M., H\u00f8yer, P., Magniez, F., Santha, M., de Wolf, R.: Quantum Algorithms for Element Distinctness. SIAM J. Comput.\u00a034(6), 1324\u20131330 (2005)","journal-title":"SIAM J. Comput."},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-25385-0_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"Y. Chen","year":"2011","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: Better Lattice Security Estimates. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 1\u201320. Springer, Heidelberg (2011)"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/RevModPhys.82.1","volume":"82","author":"A. Childs","year":"2010","unstructured":"Childs, A., Van Dam, W.: Quantum algorithms for algebraic problems. Rev. Mod. Phys.\u00a082, 1\u201352 (2010)","journal-title":"Rev. Mod. Phys."},{"key":"6_CR16","unstructured":"Childs, A.M., Jao, D., Soukharev, V.: Constructing elliptic curve isogenies in quantum subexponential time. arXiv:1012.4019 (2010)"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1090\/S0025-5718-1985-0777278-8","volume":"44","author":"U. Fincke","year":"1985","unstructured":"Fincke, U., Pohst, M.: Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Math. Comp.\u00a044, 463\u2013471 (1985)","journal-title":"Math. Comp."},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-78967-3_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"N. Gama","year":"2008","unstructured":"Gama, N., Nguyen, P.Q.: Predicting lattice reduction. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 31\u201351. Springer, Heidelberg (2008)"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-13190-5_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"N. Gama","year":"2010","unstructured":"Gama, N., Nguyen, P.Q., Regev, O.: Lattice Enumeration Using Extreme Pruning. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 257\u2013278. Springer, Heidelberg (2010)"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Dwork, C. (ed.) STOC 2008, pp. 197\u2013206. ACM (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A fully homomorphic encryption scheme (Doctoral dissertation, Stanford University) (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"160501","DOI":"10.1103\/PhysRevLett.100.160501","volume":"100","author":"V. Giovannetti","year":"2008","unstructured":"Giovannetti, V., Lloyd, S., Maccone, L.: Quantum Random Access Memory. Phys. Rev. Lett.\u00a0100, 160501 (2008)","journal-title":"Phys. Rev. Lett."},{"key":"6_CR23","first-page":"212","volume-title":"28th Annual ACM Symposium on Theory of Computing (STOC)","author":"L.K. Grover","year":"1996","unstructured":"Grover, L.K.: A Fast Quantum Mechanical Algorithm for Database Search. In: 28th Annual ACM Symposium on Theory of Computing (STOC), pp. 212\u2013219. ACM, New York (1996)"},{"issue":"3","key":"6_CR24","first-page":"201","volume":"4","author":"L. Grover","year":"2004","unstructured":"Grover, L., Rudolph, T.: How significant are the known collision and element distinctness quantum algorithms? Quantum Info. Comput.\u00a04(3), 201\u2013206 (2004)","journal-title":"Quantum Info. Comput."},{"issue":"1","key":"6_CR25","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/1206035.1206039","volume":"54","author":"S. Hallgren","year":"2007","unstructured":"Hallgren, S.: Polynomial-time quantum algorithms for Pell\u2019s equation and the principal ideal problem. J. ACM.\u00a054(1), 653\u2013658 (2007)","journal-title":"J. ACM."},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-20901-7_10","volume-title":"Coding and Cryptology","author":"G. Hanrot","year":"2011","unstructured":"Hanrot, G., Pujol, X., Stehl\u00e9, D.: Algorithms for the Shortest and Closest Lattice Vector Problems. In: Chee, Y.M., Guo, Z., Ling, S., Shao, F., Tang, Y., Wang, H., Xing, C. (eds.) IWCC 2011. LNCS, vol.\u00a06639, pp. 159\u2013190. Springer, Heidelberg (2011)"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J. Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: A ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 267\u2013288. Springer, Heidelberg (1998)"},{"key":"6_CR28","unstructured":"Jeffery, S.: Collision Finding with Many Classical or Quantum Processors. Master\u2019s thesis, University of Waterloo (2011)"},{"issue":"1","key":"6_CR29","first-page":"3","volume":"14","author":"G. Kabatiansky","year":"1978","unstructured":"Kabatiansky, G., Levenshtein, V.I.: On Bounds for Packings on a Sphere and in Space. Problemy Peredachi Informacii\u00a014(1), 3\u201325 (1978)","journal-title":"Problemy Peredachi Informacii"},{"key":"6_CR30","first-page":"193","volume-title":"15th Annual ACM Symposium on Theory of Computing (STOC)","author":"R. Kannan","year":"1983","unstructured":"Kannan, R.: Improved Algorithms for Integer Programming and Related Lattice Problems. In: 15th Annual ACM Symposium on Theory of Computing (STOC), pp. 193\u2013206. ACM, New York (1983)"},{"issue":"5","key":"6_CR31","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1145\/1089023.1089027","volume":"52","author":"S. Khot","year":"2005","unstructured":"Khot, S.: Hardness of approximating the shortest vector problem in lattices. Journal of the ACM\u00a052(5), 789\u2013808 (2005)","journal-title":"Journal of the ACM"},{"key":"6_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-642-23951-9_12","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"P.C. Kuo","year":"2011","unstructured":"Kuo, P.C., Schneider, M., Dagdelen, \u00d6., Reichelt, J., Buchmann, J., Cheng, C.M., Yang, B.Y.: Extreme Enumeration on GPU and in Clouds. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol.\u00a06917, pp. 176\u2013191. Springer, Heidelberg (2011)"},{"issue":"1","key":"6_CR33","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/S0097539703436345","volume":"35","author":"G. Kuperberg","year":"2005","unstructured":"Kuperberg, G.: A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem. SIAM J. Comput.\u00a035(1), 170\u2013188 (2005)","journal-title":"SIAM J. Comput."},{"key":"6_CR34","unstructured":"Kuperberg, G.: Another Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem. arXiv, Report 1112\/3333, pp. 1\u201310 (2011)"},{"key":"6_CR35","unstructured":"Laarhoven, T., van de Pol, J., de Weger, B.: Solving Hard Lattice Problems and the Security of Lattice-Based Cryptosystems. Cryptology ePrint Archive, Report 2012\/533, pp. 1\u201343 (2012)"},{"key":"6_CR36","unstructured":"TU Darmstadt Lattice Challenge, http:\/\/www.latticechallenge.org\/"},{"issue":"4","key":"6_CR37","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., Lov\u00e1sz, L.: Factoring Polynomials with Rational Coefficients. Math. Ann.\u00a0261(4), 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"6_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-24587-2_22","volume-title":"Algorithms and Computation","author":"C. Ludwig","year":"2003","unstructured":"Ludwig, C.: A Faster Lattice Reduction Method Using Quantum Search. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 199\u2013208. Springer, Heidelberg (2003)"},{"key":"6_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-642-29011-4_43","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"V. Lyubashevsky","year":"2012","unstructured":"Lyubashevsky, V.: Lattice signatures without trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 738\u2013755. Springer, Heidelberg (2012)"},{"key":"6_CR40","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1145\/1806689.1806739","volume-title":"42nd Annual ACM Symposium on Theory of Computing (STOC)","author":"D. Micciancio","year":"2010","unstructured":"Micciancio, D., Voulgaris, P.: A Deterministic Single Exponential Time Algorithm for Most Lattice Problems based on Voronoi Cell Computations. In: 42nd Annual ACM Symposium on Theory of Computing (STOC), pp. 351\u2013358. ACM, New York (2010)"},{"key":"6_CR41","first-page":"1468","volume-title":"21st Annual ACM Symposium on Discrete Algorithms (SODA)","author":"D. Micciancio","year":"2010","unstructured":"Micciancio, D., Voulgaris, P.: Faster Exponential Time Algorithms for the Shortest Vector Problem. In: 21st Annual ACM Symposium on Discrete Algorithms (SODA), pp. 1468\u20131480. ACM, New York (2010)"},{"key":"6_CR42","doi-asserted-by":"crossref","unstructured":"Mosca, M.: Quantum Algorithms. In: Meyers, R. (ed.) Encyclopedia of Complexity and Systems Science (2009)","DOI":"10.1007\/978-0-387-30440-3_423"},{"issue":"2","key":"6_CR43","first-page":"181","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. Crypt.\u00a02(2), 181\u2013207 (2008)","journal-title":"J. Math. Crypt."},{"issue":"1","key":"6_CR44","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/1089242.1089247","volume":"15","author":"M. Pohst","year":"1981","unstructured":"Pohst, M.: On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications. ACM SIGSAM Bulletin\u00a015(1), 37\u201344 (1981)","journal-title":"ACM SIGSAM Bulletin"},{"key":"6_CR45","unstructured":"van de Pol, J.: Lattice-based cryptography. Master\u2019s thesis. Eindhoven University of Technology (2011)"},{"key":"6_CR46","unstructured":"Pujol, X., Stehl\u00e9, D.: Solving the Shortest Lattice Vector Problem in Time 22.465n. Cryptology ePrint Archive, Report 2009\/605, pp.\u00a01\u20137 (2009)"},{"key":"6_CR47","unstructured":"Regev, O.: A Subexponential Time Algorithm for the Dihedral Hidden Subgroup Problem with Polynomial Space. arXiv, Report 0405\/151, pp.\u00a01\u20137 (2004)"},{"key":"6_CR48","unstructured":"Regev, O.: Lattices in Computer Science. Lecture Notes for a Course at the Tel Aviv University (2004)"},{"issue":"3","key":"6_CR49","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1137\/S0097539703440678","volume":"33","author":"O. Regev","year":"2004","unstructured":"Regev, O.: Quantum Computation and Lattice Problems. SIAM J. Comput.\u00a033(3), 738\u2013760 (2004)","journal-title":"SIAM J. Comput."},{"key":"6_CR50","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: 37th Annual ACM Symposium on Theory of Computing (STOC), pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"6_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-79228-4_3","volume-title":"Theory and Applications of Models of Computation","author":"M. Santha","year":"2008","unstructured":"Santha, M.: Quantum Walk Based Search Algorithms. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 31\u201346. Springer, Heidelberg (2008)"},{"key":"6_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-19094-0_11","volume-title":"WALCOM: Algorithms and Computation","author":"M. Schneider","year":"2011","unstructured":"Schneider, M.: Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices. In: Katoh, N., Kumar, A. (eds.) WALCOM 2011. LNCS, vol.\u00a06552, pp. 89\u201397. Springer, Heidelberg (2011)"},{"key":"6_CR53","unstructured":"Schneider, M.: Sieving for Short Vectors in Ideal Lattices. Cryptology ePrint Archive, Report 2011\/458, pp.\u00a01\u201319 (2011)"},{"issue":"2-3","key":"6_CR54","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C.P. Schnorr","year":"1987","unstructured":"Schnorr, C.P.: A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms. Theoretical Computer Science\u00a053(2-3), 201\u2013224 (1987)","journal-title":"Theoretical Computer Science"},{"issue":"2-3","key":"6_CR55","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. Mathematical Programming\u00a066(2-3), 181\u2013199 (1994)","journal-title":"Mathematical Programming"},{"key":"6_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36494-3_14","volume-title":"STACS 2003","author":"C.P. Schnorr","year":"2003","unstructured":"Schnorr, C.P.: Lattice reduction by random sampling and birthday methods. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 145\u2013156. Springer, Heidelberg (2003)"},{"issue":"5","key":"6_CR57","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM J. Comput.\u00a026(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"6_CR58","doi-asserted-by":"crossref","unstructured":"Smith, J.: Mosca. M.: Algorithms for Quantum Computers. In: Handbook of Natural Computing, pp. 1451\u20131492. Springer (2012)","DOI":"10.1007\/978-3-540-92910-9_43"},{"key":"6_CR59","unstructured":"SVP Challenge, http:\/\/latticechallenge.org\/svp-challenge\/"},{"key":"6_CR60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1966913.1966915","volume-title":"6th ACM Symposium on Information, Computer and Communications Security (ASIACCS)","author":"X. Wang","year":"2011","unstructured":"Wang, X., Liu, M., Tian, C., Bi, J.: Improved Nguyen-Vidick Heuristic Sieve Algorithm for Shortest Vector Problem. In: 6th ACM Symposium on Information, Computer and Communications Security (ASIACCS), pp. 1\u20139. ACM, New York (2011)"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38616-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,2]],"date-time":"2023-07-02T05:16:45Z","timestamp":1688275005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38616-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642386152","9783642386169"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38616-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}