{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:06:28Z","timestamp":1757624788556,"version":"3.44.0"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032018779"},{"type":"electronic","value":"9783032018786"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-032-01878-6_14","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T18:09:05Z","timestamp":1755367745000},"page":"416-448","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Quasi-polynomial Time Algorithm for\u00a0the\u00a0Extrapolated Dihedral Coset Problem over\u00a0Power-of-Two Moduli"],"prefix":"10.1007","author":[{"given":"Shi","family":"Bai","sequence":"first","affiliation":[]},{"given":"Hansraj","family":"Jangir","sequence":"additional","affiliation":[]},{"given":"Elena","family":"Kirshanova","sequence":"additional","affiliation":[]},{"given":"Tran","family":"Ngo","sequence":"additional","affiliation":[]},{"given":"William","family":"Youmans","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th ACM STOC, pp. 99\u2013108. ACM Press (1996). https:\/\/doi.org\/10.1145\/237814.237838","key":"14_CR1","DOI":"10.1145\/237814.237838"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-642-54631-0_25","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"MR Albrecht","year":"2014","unstructured":"Albrecht, M.R., Faug\u00e8re, J.-C., Fitzpatrick, R., Perret, L.: Lazy modulus switching for the BKW algorithm on LWE. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 429\u2013445. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_25"},{"key":"14_CR3","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, Part II. LNCS, vol. 12492, pp. 583\u2013613. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_20"},{"key":"14_CR4","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-031-48624-1_4","volume-title":"TCC 2023, Part IV","author":"P Ananth","year":"2023","unstructured":"Ananth, P., Poremba, A., Vaikuntanathan, V.: Revocable cryptography from learning with errors. In: Rothblum, G.N., Wee, H. (eds.) TCC 2023, Part IV. LNCS, vol. 14372, pp. 93\u2013122. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48624-1_4"},{"doi-asserted-by":"publisher","unstructured":"Aono, Y., Nguyen, P.Q., Shen, Y.: Quantum lattice enumeration and tweaking discrete pruning. In: Peyrin and Galbraith [41], pp. 405\u2013434. https:\/\/doi.org\/10.1007\/978-3-030-03326-2_14","key":"14_CR5","DOI":"10.1007\/978-3-030-03326-2_14"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-22006-7_34","volume-title":"Automata, Languages and Programming","author":"S Arora","year":"2011","unstructured":"Arora, S., Ge, R.: New algorithms for learning in presence of errors. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 403\u2013415. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_34"},{"key":"14_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-981-99-8727-6_5","volume-title":"ASIACRYPT 2023, Part III","author":"S Bai","year":"2023","unstructured":"Bai, S., Van Hoof, I., Johnson, F., Lange, T., Ngo, T.: Concrete analysis of quantum lattice enumeration. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023, Part III. LNCS, vol. 14440, pp. 131\u2013166. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8727-6_5"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/BF01445125","volume":"296","author":"W Banaszczyk","year":"1993","unstructured":"Banaszczyk, W.: New bounds in some transference theorems in the geometry of numbers. Math. Ann. 296, 625\u2013635 (1993)","journal-title":"Math. Ann."},{"key":"14_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-031-68391-6_3","volume-title":"CRYPTO 2024, Part VI","author":"N Bindel","year":"2024","unstructured":"Bindel, N., Bonnetain, X., Tiepelt, M., Virdia, F.: Quantum lattice enumeration in limited depth. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part VI. LNCS, vol. 14925, pp. 72\u2013106. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68391-6_3"},{"unstructured":"Bonnetain, X.: Hidden structures and quantum cryptanalysis. (Structures cach\u00e9es et cryptanalyse quantique). Ph.D. thesis, Sorbonne University, France (2019). https:\/\/tel.archives-ouvertes.fr\/tel-02400328","key":"14_CR10"},{"key":"14_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-031-30589-4_8","volume-title":"EUROCRYPT 2023, Part V","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"},{"doi-asserted-by":"publisher","unstructured":"Bonnetain, X., Naya-Plasencia, M.: Hidden shift quantum cryptanalysis and implications. In: Peyrin and Galbraith [41], pp. 560\u2013592. https:\/\/doi.org\/10.1007\/978-3-030-03326-2_19","key":"14_CR12","DOI":"10.1007\/978-3-030-03326-2_19"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1007\/978-3-319-76581-5_24","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"Z Brakerski","year":"2018","unstructured":"Brakerski, Z., Kirshanova, E., Stehl\u00e9, D., Wen, W.: Learning with errors and extrapolated dihedral cosets. In: Abdalla, M., Dahab, R. (eds.) PKC 2018, Part II. LNCS, vol. 10770, pp. 702\u2013727. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76581-5_24"},{"doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th ACM STOC, pp. 575\u2013584. ACM Press (2013). https:\/\/doi.org\/10.1145\/2488608.2488680","key":"14_CR14","DOI":"10.1145\/2488608.2488680"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-319-31517-1_2","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2016","author":"J Buchmann","year":"2016","unstructured":"Buchmann, J., G\u00f6pfert, F., Player, R., Wunderer, T.: On the hardness of LWE with binary error: revisiting the hybrid lattice-reduction and meet-in-the-middle attack. In: Pointcheval, D., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2016. LNCS, vol. 9646, pp. 24\u201343. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31517-1_2"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-92068-5_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"A Chailloux","year":"2021","unstructured":"Chailloux, A., Loyer, J.: Lattice sieving via quantum random walks. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021, Part IV. LNCS, vol. 13093, pp. 63\u201391. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_3"},{"unstructured":"Chen, Y., Hu, Z., Liu, Q., Luo, H., Tu, Y.: LWE with quantum amplitudes: algorithm, hardness, and oblivious sampling. Cryptology ePrint Archive, Paper 2023\/1498 (2023). https:\/\/eprint.iacr.org\/2023\/1498","key":"14_CR17"},{"unstructured":"Chen, Y., Hu, Z., Liu, Q., Luo, H., Tu, Y.: On the hardness of $$\\sf {{S}|{LWE}\\rangle }$$ with gaussian and other amplitudes. Cryptology ePrint Archive, Report 2023\/1498 (2023). https:\/\/eprint.iacr.org\/2023\/1498","key":"14_CR18"},{"key":"14_CR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-031-07082-2_14","volume-title":"EUROCRYPT 2022, Part III","author":"Y Chen","year":"2022","unstructured":"Chen, Y., Liu, Q., Zhandry, M.: Quantum algorithms for variants of average-case lattice problems via filtering. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part III. LNCS, vol. 13277, pp. 372\u2013401. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_14"},{"key":"14_CR20","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"},{"unstructured":"Childs, A.M., van Dam, W.: Quantum algorithm for a generalized hidden shift problem. In: Bansal, N., Pruhs, K., Stein, C. (eds.) 18th SODA, pp. 1225\u20131232. ACM-SIAM (2007)","key":"14_CR21"},{"unstructured":"Coppersmith, D.: An approximate Fourier transform useful in quantum factoring (2002)","key":"14_CR22"},{"unstructured":"Dawson, C.M., Nielsen, M.A.: The Solovay-Kitaev algorithm (2005). https:\/\/arxiv.org\/abs\/quant-ph\/0505030","key":"14_CR23"},{"doi-asserted-by":"publisher","unstructured":"Debris-Alazard, T., Fallahpour, P., Stehl\u00e9, D.: Quantum oblivious LWE sampling and insecurity of standard model lattice-based SNARKs. In: Mohar, B., Shinkar, I., O\u2019Donnell, R. (eds.) 56th ACM STOC, pp. 423\u2013434. ACM Press (2024). https:\/\/doi.org\/10.1145\/3618260.3649766","key":"14_CR24","DOI":"10.1145\/3618260.3649766"},{"unstructured":"Doliskani, J.: Efficient quantum public-key encryption from learning with errors. Cryptology ePrint Archive, Report 2020\/1557 (2020). https:\/\/eprint.iacr.org\/2020\/1557","key":"14_CR25"},{"key":"14_CR26","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"},{"doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 197\u2013206. ACM Press (2008). https:\/\/doi.org\/10.1145\/1374376.1374407","key":"14_CR27","DOI":"10.1145\/1374376.1374407"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-74143-5_10","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"G Hanrot","year":"2007","unstructured":"Hanrot, G., Stehl\u00e9, D.: Improved analysis of Kannan\u2019s shortest lattice vector algorithm. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 170\u2013186. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_10"},{"doi-asserted-by":"publisher","unstructured":"Ivanyos, G., Prakash, A., Santha, M.: On learning linear functions from subset and its applications in quantum computing. In: Azar, Y., Bast, H., Herman, G. (eds.) 26th Annual European Symposium on Algorithms, ESA 2018, Helsinki, Finland, 20\u201322 August 2018. LIPIcs, vol.\u00a0112, pp. 66:1\u201366:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPICS.ESA.2018.66","key":"14_CR29","DOI":"10.4230\/LIPICS.ESA.2018.66"},{"unstructured":"Kirshanova, E.: A $$k$$-list algorithm for LWE (2020). https:\/\/crypto-kantiana.com\/elena.kirshanova\/talks\/Simons_Hardness.pdf","key":"14_CR30"},{"issue":"6","key":"14_CR31","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1070\/RM1997v052n06ABEH002155","volume":"52","author":"AY Kitaev","year":"1997","unstructured":"Kitaev, A.Y.: Quantum computations: algorithms and error correction. Russ. Math. Surv. 52(6), 1191\u20131249 (1997)","journal-title":"Russ. Math. Surv."},{"unstructured":"Kitaev, A.Y.: Quantum measurements and the abelian stabilizer problem. Electron. Colloquium Comput. Complex. TR96 (1995)","key":"14_CR32"},{"issue":"1","key":"14_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. 35(1), 170\u2013188 (2005). https:\/\/doi.org\/10.1137\/S0097539703436345","journal-title":"SIAM J. Comput."},{"unstructured":"Kuperberg, G.: Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem (2011). https:\/\/arxiv.org\/abs\/1112.3333","key":"14_CR34"},{"key":"14_CR35","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. 7237, pp. 738\u2013755. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_43"},{"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":"14_CR36"},{"doi-asserted-by":"publisher","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. In: 45th FOCS, pp. 372\u2013381. IEEE Computer Society Press (2004). https:\/\/doi.org\/10.1109\/FOCS.2004.72","key":"14_CR37","DOI":"10.1109\/FOCS.2004.72"},{"key":"14_CR38","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"},{"unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press (2010)","key":"14_CR39"},{"doi-asserted-by":"crossref","unstructured":"Ozols, M., Roetteler, M., Roland, J.: Quantum rejection sampling. ACM Trans. Comput. Theory 5(3) (2013)","key":"14_CR40","DOI":"10.1145\/2493252.2493256"},{"key":"14_CR41","series-title":"LNCS","volume-title":"ASIACRYPT 2018, Part I","year":"2018","unstructured":"Peyrin, T., Galbraith, S. (eds.): ASIACRYPT 2018, Part I. LNCS, vol. 11272. Springer, Cham (2018)"},{"doi-asserted-by":"publisher","unstructured":"Poremba, A.: Quantum proofs of deletion for learning with errors. In: Kalai, Y.T. (ed.) ITCS 2023, vol.\u00a0251, pp. 90:1\u201390:14. LIPIcs (2023). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2023.90","key":"14_CR42","DOI":"10.4230\/LIPIcs.ITCS.2023.90"},{"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":"14_CR43"},{"doi-asserted-by":"publisher","unstructured":"Regev, O.: Quantum computation and lattice problems. In: 43rd FOCS, pp. 520\u2013529. IEEE Computer Society Press (2002). https:\/\/doi.org\/10.1109\/SFCS.2002.1181976","key":"14_CR44","DOI":"10.1109\/SFCS.2002.1181976"},{"unstructured":"Regev, O.: A subexponential time algorithm for the dihedral hidden subgroup problem with polynomial space (2004). https:\/\/arxiv.org\/abs\/quant-ph\/0406151","key":"14_CR45"},{"doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) 37th ACM STOC, pp. 84\u201393. ACM Press (2005). https:\/\/doi.org\/10.1145\/1060590.1060603","key":"14_CR46","DOI":"10.1145\/1060590.1060603"},{"key":"14_CR47","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-642-02295-1_15","volume-title":"The LLL Algorithm","author":"O Regev","year":"2009","unstructured":"Regev, O.: On the complexity of lattice problems with polynomial approximation factors. In: Nguyen, P., Vall\u00e9e, B. (eds.) The LLL Algorithm. ISC, pp. 475\u2013496. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02295-1_15"},{"issue":"1","key":"14_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4007\/annals.2024.199.1.1","volume":"199","author":"O Regev","year":"2024","unstructured":"Regev, O., Stephens-Davidowitz, N.: A reverse Minkowski theorem. Ann. Math. 199(1), 1\u201349 (2024)","journal-title":"Ann. Math."},{"key":"14_CR49","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)","journal-title":"Math. Program."},{"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":"14_CR50"},{"key":"14_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-642-10366-7_36","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"D Stehl\u00e9","year":"2009","unstructured":"Stehl\u00e9, D., Steinfeld, R., Tanaka, K., Xagawa, K.: Efficient public key encryption based on ideal lattices. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 617\u2013635. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_36"},{"key":"14_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-45708-9_19","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"D Wagner","year":"2002","unstructured":"Wagner, D.: A generalized birthday problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 288\u2013304. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_19"},{"key":"14_CR53","doi-asserted-by":"publisher","DOI":"10.1017\/9781316848142","volume-title":"The Theory of Quantum Information","author":"J Watrous","year":"2018","unstructured":"Watrous, J.: The Theory of Quantum Information. Cambridge University Press, Cambridge (2018)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01878-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T15:12:42Z","timestamp":1757430762000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01878-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018779","9783032018786"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01878-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}