{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T04:19:31Z","timestamp":1775794771698,"version":"3.50.1"},"publisher-location":"Cham","reference-count":67,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683909","type":"print"},{"value":"9783031683916","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-68391-6_3","type":"book-chapter","created":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T19:02:14Z","timestamp":1723834934000},"page":"72-106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Quantum Lattice Enumeration in\u00a0Limited Depth"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6677-2474","authenticated-orcid":false,"given":"Nina","family":"Bindel","sequence":"first","affiliation":[]},{"given":"Xavier","family":"Bonnetain","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3389-208X","authenticated-orcid":false,"given":"Marcel","family":"Tiepelt","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0001-2955","authenticated-orcid":false,"given":"Fernando","family":"Virdia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,17]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Aaronson, S., Ambainis, A.: Quantum search of spatial regions, pp. 200\u2013209 (2003). https:\/\/doi.org\/10.1109\/SFCS.2003.1238194","DOI":"10.1109\/SFCS.2003.1238194"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem, pp. 601\u2013610 (2001). https:\/\/doi.org\/10.1145\/380752.380857","DOI":"10.1145\/380752.380857"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-030-56880-1_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"MR Albrecht","year":"2020","unstructured":"Albrecht, M.R., Bai, S., Fouque, P.-A., Kirchner, P., Stehl\u00e9, D., Wen, W.: Faster\u00a0enumeration-based\u00a0lattice\u00a0reduction: root\u00a0Hermite\u00a0factor\u00a0$$k^{1\/(2k)}$$\u00a0Time\u00a0$$k^{k\/8+o(k)}$$. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 186\u2013212. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_7"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1007\/978-3-030-84245-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"MR Albrecht","year":"2021","unstructured":"Albrecht, M.R., Bai, S., Li, J., Rowell, J.: Lattice reduction with approximate enumeration oracles. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 732\u2013759. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_25"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-319-98113-0_19","volume-title":"Security and Cryptography for Networks","author":"MR Albrecht","year":"2018","unstructured":"Albrecht, M.R., et al.: Estimate all the LWE, NTRU schemes! In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 351\u2013367. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_19"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/978-3-030-17656-3_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"MR Albrecht","year":"2019","unstructured":"Albrecht, M.R., Ducas, L., Herold, G., Kirshanova, E., Postlethwaite, E.W., Stevens, M.: The general sieve kernel and new records in lattice reduction. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 717\u2013746. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_25"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/978-3-030-64834-3_20","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"MR Albrecht","year":"2020","unstructured":"Albrecht, M.R., Gheorghiu, V., Postlethwaite, E.W., Schanck, J.M.: Estimating quantum speedups for lattice sieves. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 583\u2013613. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_20"},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015). https:\/\/doi.org\/10.1515\/jmc-2015-0016","journal-title":"J. Math. Cryptol."},{"key":"3_CR9","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key exchange - a new hope, pp. 327\u2013343 (2016)"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Ambainis, A., Kokainis, M.: Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games. In: Hatami, H., McKenzie, P., King, V. (eds.) Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, 19\u201323 June 2017, pp. 989\u20131002. ACM (2017). https:\/\/doi.org\/10.1145\/3055399.3055444","DOI":"10.1145\/3055399.3055444"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-319-96881-0_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"Y Aono","year":"2018","unstructured":"Aono, Y., Nguyen, P.Q., Seito, T., Shikata, J.: Lower bounds on lattice enumeration with\u00a0extreme pruning. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 608\u2013637. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_21"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-030-03326-2_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"Y Aono","year":"2018","unstructured":"Aono, Y., Nguyen, P.Q., Shen, Y.: Quantum lattice enumeration and tweaking discrete pruning. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11272, pp. 405\u2013434. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_14"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/978-3-662-49890-3_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"Y Aono","year":"2016","unstructured":"Aono, Y., Wang, Y., Hayashi, T., Takagi, T.: Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 789\u2013819. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_30"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-319-08344-5_21","volume-title":"Information Security and Privacy","author":"S Bai","year":"2014","unstructured":"Bai, S., Galbraith, S.D.: Lattice decoding attacks on binary LWE. In: Susilo, W., Mu, Y. (eds.) ACISP 2014. LNCS, vol. 8544, pp. 322\u2013337. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08344-5_21"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-981-99-8727-6_5","volume-title":"Advances in Cryptology","author":"S Bai","year":"2023","unstructured":"Bai, S., van Hoof, M.I., Johnson, F.B., Lange, T., Ngo, T.: Concrete analysis of qantum lattice enumeration. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023. LNCS, vol. 14440, pp. 131\u2013166. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8727-6_5"},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: Krauthgamer, R. (ed.) Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, 10\u201312 January 2016, pp. 10\u201324. SIAM (2016). https:\/\/doi.org\/10.1137\/1.9781611974331.ch2","DOI":"10.1137\/1.9781611974331.ch2"},{"issue":"4","key":"3_CR17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.042313","volume":"71","author":"AJ Bessen","year":"2005","unstructured":"Bessen, A.J.: Lower bound for quantum phase estimation. Phys. Rev. A 71(4), 042313 (2005)","journal-title":"Phys. Rev. A"},{"key":"3_CR18","unstructured":"Bindel, N., Bonnetain, X., Tiepelt, M., Virdia, F.: Quantum lattice enumeration in limited depth. Cryptology ePrint Archive, Paper 2023\/1423 (2023). https:\/\/eprint.iacr.org\/2023\/1423"},{"key":"3_CR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-031-30589-4_8","volume-title":"Advances in Cryptology","author":"X Bonnetain","year":"2023","unstructured":"Bonnetain, X., Chailloux, A., Schrottenloher, A., Shen, Y.: Finding many collisions via reusable quantum walks - application to lattice sieving. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part V. LNCS, vol. 14008, pp. 221\u2013251. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_8"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.22331\/q-2019-07-18-167","volume":"3","author":"E Campbell","year":"2019","unstructured":"Campbell, E., Khurana, A., Montanaro, A.: Applying quantum algorithms to constraint satisfaction problems. Quantum 3, 167 (2019). https:\/\/doi.org\/10.22331\/q-2019-07-18-167","journal-title":"Quantum"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Chailloux, A., Loyer, J.: Lattice sieving via quantum random walks (2021)","DOI":"10.1007\/978-3-030-92068-5_3"},{"key":"3_CR22","unstructured":"Chen, Y.: R\u00e9duction de r\u00e9seau et s\u00e9curit\u00e9 concr\u00e8te du chiffrement compl\u00e8tement homomorphe. Ph.D. thesis, Paris 7 (2013). https:\/\/archive.org\/details\/PhDChen13"},{"key":"3_CR23","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. 7073, pp. 1\u201320. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_1"},{"key":"3_CR24","unstructured":"Dagdelen, \u00d6., Schneider, M.: Parallel enumeration of shortest lattice vectors. Cryptology ePrint Archive, Report 2010\/097 (2010). https:\/\/eprint.iacr.org\/2010\/097"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-030-81652-0_14","volume-title":"Selected Areas in Cryptography","author":"JH Davenport","year":"2021","unstructured":"Davenport, J.H., Pring, B.: Improvements to quantum search techniques for block-ciphers, with\u00a0applications to AES. In: Dunkelman, O., Jacobson, Jr., M.J., O\u2019Flynn, C. (eds.) SAC 2020. LNCS, vol. 12804, pp. 360\u2013384. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81652-0_14"},{"issue":"4","key":"3_CR26","first-page":"351","volume":"6","author":"TG Draper","year":"2006","unstructured":"Draper, T.G., Kutin, S.A., Rains, E.M., Svore, K.M.: A logarithmic-depth quantum carry-lookahead adder. Quantum Inf. Comput. 6(4), 351\u2013369 (2006)","journal-title":"Quantum Inf. Comput."},{"issue":"170","key":"3_CR27","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. Comput. 44(170), 463\u2013471 (1985)","journal-title":"Math. Comput."},{"key":"3_CR28","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.E.: Improved methods for calculating vectors of short length in a lattice. Math. Comput. 44, 463\u2013471 (1985)","journal-title":"Math. Comput."},{"key":"3_CR29","doi-asserted-by":"publisher","unstructured":"Fowler, A.G., Mariantoni, M., Martinis, J.M., Cleland, A.N.: Surface codes: towards practical large-scale quantum computation. Phys. Rev. A 86(3) (2012). https:\/\/doi.org\/10.1103\/physreva.86.032324","DOI":"10.1103\/physreva.86.032324"},{"key":"3_CR30","doi-asserted-by":"publisher","unstructured":"Gama, N., Nguyen, P.Q.: Finding short lattice vectors within Mordell\u2019s inequality, pp. 207\u2013216 (2008). https:\/\/doi.org\/10.1145\/1374376.1374408","DOI":"10.1145\/1374376.1374408"},{"key":"3_CR31","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. 6110, pp. 257\u2013278. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_13"},{"key":"3_CR32","doi-asserted-by":"publisher","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. 100, 160501 (2008). https:\/\/doi.org\/10.1103\/PhysRevLett.100.160501","journal-title":"Phys. Rev. Lett."},{"key":"3_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-030-44223-1_23","volume-title":"Post-Quantum Cryptography","author":"T H\u00e4ner","year":"2020","unstructured":"H\u00e4ner, T., Jaques, S., Naehrig, M., Roetteler, M., Soeken, M.: Improved quantum circuits for elliptic curve discrete logarithms. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 425\u2013444. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_23"},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"Hermans, J., Schneider, M., Buchmann, J., Vercauteren, F., Preneel, B.: Parallel shortest lattice vector enumeration on graphics cards, pp. 52\u201368 (2010)","DOI":"10.1007\/978-3-642-12678-9_4"},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-030-45724-2_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"S Jaques","year":"2020","unstructured":"Jaques, S., Naehrig, M., Roetteler, M., Virdia, F.: Implementing Grover oracles for quantum key search on AES and LowMC. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 280\u2013310. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_10"},{"key":"3_CR36","unstructured":"Jaques, S., Rattew, A.G.: QRAM: a survey and critique (2023)"},{"key":"3_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-030-26948-7_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"S Jaques","year":"2019","unstructured":"Jaques, S., Schanck, J.M.: Quantum cryptanalysis in the RAM model: claw-finding attacks on SIKE. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 32\u201361. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_2"},{"key":"3_CR38","doi-asserted-by":"publisher","unstructured":"Jones, N., et al.: Layered architecture for quantum computing. Phys. Rev. X 2 (2012). https:\/\/doi.org\/10.1103\/PhysRevX.2.031007","DOI":"10.1103\/PhysRevX.2.031007"},{"key":"3_CR39","doi-asserted-by":"publisher","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems, pp. 193\u2013206 (1983). https:\/\/doi.org\/10.1145\/800061.808749","DOI":"10.1145\/800061.808749"},{"key":"3_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/978-3-030-34578-5_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"E Kirshanova","year":"2019","unstructured":"Kirshanova, E., M\u00e5rtensson, E., Postlethwaite, E.W., Moulik, S.R.: Quantum algorithms for the approximate k-list problem and their application to lattice sieving. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 521\u2013551. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_19"},{"key":"3_CR41","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., et al.: Extreme enumeration on GPU and in clouds. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 176\u2013191. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23951-9_12"},{"key":"3_CR42","unstructured":"Kuperberg, G.: Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem (2011). arXiv preprint arXiv:1112.3333"},{"key":"3_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-47989-6_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"T Laarhoven","year":"2015","unstructured":"Laarhoven, T.: Sieving for shortest vectors in lattices using angular locality-sensitive hashing. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 3\u201322. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_1"},{"key":"3_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-38616-9_6","volume-title":"Post-Quantum Cryptography","author":"T Laarhoven","year":"2013","unstructured":"Laarhoven, T., Mosca, M., van de Pol, J.: Solving the shortest vector problem in lattices faster using quantum search. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 83\u2013101. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38616-9_6"},{"key":"3_CR45","unstructured":"Li, J., Nguyen, P.Q.: A complete analysis of the BKZ lattice reduction algorithm. Cryptology ePrint Archive, Report 2020\/1237 (2020). https:\/\/eprint.iacr.org\/2020\/1237"},{"key":"3_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-19074-2_21","volume-title":"Topics in Cryptology \u2013 CT-RSA 2011","author":"R Lindner","year":"2011","unstructured":"Lindner, R., Peikert, C.: Better key sizes (and attacks) for LWE-based encryption. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol. 6558, pp. 319\u2013339. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19074-2_21"},{"key":"3_CR47","unstructured":"Lyubashevsky, V., et al.: CRYSTALS-DILITHIUM. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"3_CR48","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Walter, M.: Fast lattice point enumeration with minimal overhead, pp. 276\u2013294 (2015). https:\/\/doi.org\/10.1137\/1.9781611973730.21","DOI":"10.1137\/1.9781611973730.21"},{"key":"3_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1007\/978-3-662-49890-3_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"D Micciancio","year":"2016","unstructured":"Micciancio, D., Walter, M.: Practical, predictable lattice basis reduction. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 820\u2013849. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_31"},{"issue":"1","key":"3_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2018.v014a015","volume":"14","author":"A Montanaro","year":"2018","unstructured":"Montanaro, A.: Quantum-walk speedup of backtracking algorithms. Theory Comput. 14(1), 1\u201324 (2018). https:\/\/doi.org\/10.4086\/toc.2018.v014a015","journal-title":"Theory Comput."},{"issue":"15","key":"3_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2018.v014a015","volume":"14","author":"A Montanaro","year":"2018","unstructured":"Montanaro, A.: Quantum-walk speedup of backtracking algorithms. Theory Comput. 14(15), 1\u201324 (2018). https:\/\/doi.org\/10.4086\/toc.2018.v014a015","journal-title":"Theory Comput."},{"issue":"2","key":"3_CR52","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1515\/JMC.2008.009","volume":"2","author":"PQ Nguyen","year":"2008","unstructured":"Nguyen, P.Q., Vidick, T.: Sieve algorithms for the shortest vector problem are practical. J. Math. Cryptol. 2(2), 181\u2013207 (2008). https:\/\/doi.org\/10.1515\/JMC.2008.009","journal-title":"J. Math. Cryptol."},{"key":"3_CR53","doi-asserted-by":"publisher","unstructured":"Nie, J., Zhu, Q., Li, M., Sun, X.: Quantum circuit design for integer multiplication based on Sch\u00f6nhage-Strassen algorithm. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. (2023). https:\/\/doi.org\/10.1109\/TCAD.2023.3279300","DOI":"10.1109\/TCAD.2023.3279300"},{"key":"3_CR54","unstructured":"NIST: Submission requirements and evaluation criteria for the post-quantum cryptography standardization process (2016). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/call-for-proposals-final-dec-2016.pdf"},{"issue":"1","key":"3_CR55","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. SIGSAM Bull. 15(1), 37\u201344 (1981). https:\/\/doi.org\/10.1145\/1089242.1089247","journal-title":"SIGSAM Bull."},{"key":"3_CR56","doi-asserted-by":"publisher","unstructured":"Preskill, J.: Quantum Computing in the NISQ era and beyond. Quantum 2, 79 (Aug 2018). https:\/\/doi.org\/10.22331\/q-2018-08-06-79, https:\/\/doi.org\/10.22331\/q-2018-08-06-79","DOI":"10.22331\/q-2018-08-06-79"},{"key":"3_CR57","unstructured":"Prest, T., et al.: FALCON. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"3_CR58","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, 22\u201324 May 2005, pp. 84\u201393. ACM (2005). https:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"},{"key":"3_CR59","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 34:1\u201334:40 (2009). https:\/\/doi.org\/10.1145\/1568318.1568324","DOI":"10.1145\/1568318.1568324"},{"key":"3_CR60","unstructured":"Schanck, J.M., Hulsing, A., Rijneveld, J., Schwabe, P.: NTRU-HRSS-KEM. Technical report, National Institute of Standards and Technology (2017). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-1-submissions"},{"key":"3_CR61","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C Schnorr","year":"1994","unstructured":"Schnorr, C., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66, 181\u2013199 (1994). https:\/\/doi.org\/10.1007\/BF01581144","journal-title":"Math. Program."},{"key":"3_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/3-540-54458-5_51","volume-title":"Fundamentals of Computation Theory","author":"CP Schnorr","year":"1991","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. In: Budach, L. (ed.) FCT 1991. LNCS, vol. 529, pp. 68\u201385. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54458-5_51"},{"key":"3_CR63","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"CP Schnorr","year":"1994","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66, 181\u2013199 (1994)","journal-title":"Math. Program."},{"key":"3_CR64","unstructured":"Schwabe, P., et al.: CRYSTALS-KYBER. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"3_CR65","unstructured":"TF development team: fplll, a lattice reduction library, Version: 5.4.2 (2023). https:\/\/github.com\/fplll\/fplll"},{"issue":"4","key":"3_CR66","doi-asserted-by":"publisher","first-page":"2746","DOI":"10.1103\/PhysRevA.60.2746","volume":"60","author":"C Zalka","year":"1999","unstructured":"Zalka, C.: Grover\u2019s quantum searching algorithm is optimal. Phys. Rev. A 60(4), 2746 (1999)","journal-title":"Phys. Rev. A"},{"key":"3_CR67","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/978-3-030-64834-3_24","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"J Zou","year":"2020","unstructured":"Zou, J., Wei, Z., Sun, S., Liu, X., Wu, W.: Quantum circuit implementations of AES with fewer qubits. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 697\u2013726. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_24"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68391-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T15:03:45Z","timestamp":1730214225000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68391-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683909","9783031683916"],"references-count":67,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68391-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"17 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}