{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T11:53:37Z","timestamp":1774439617047,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T00:00:00Z","timestamp":1718236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T00:00:00Z","timestamp":1718236800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"University of Bergen"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2024,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In post-quantum cryptography, Learning With Errors (LWE) is one of the dominant underlying mathematical problems. The dual attack is one of the main strategies for solving the LWE problem, and it has recently gathered significant attention within the research community. The attack strategy consists of a lattice reduction part and a distinguishing part. The latter includes an enumeration subroutine over a certain number of positions of the secret key. Our contribution consists of giving a precise and efficient approach for calculating the expected complexity of such an enumeration procedure, which was missing in the literature. This allows us to decrease the estimated cost of the whole dual attack, both classically and quantumly, on well-known protocols such as Kyber, Saber, and TFHE. In addition, we explore different enumeration strategies to investigate some potential further improvements. As our method of calculating the expected cost of enumeration is pretty general, it might be of independent interest in other areas of cryptanalysis or even in different research areas.<\/jats:p>","DOI":"10.1007\/s12095-024-00722-1","type":"journal-article","created":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T05:01:52Z","timestamp":1718254912000},"page":"1163-1182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Further improvements of the estimation of key enumeration with applications to solving LWE"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3544-5128","authenticated-orcid":false,"given":"Alessandro","family":"Budroni","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5824-7282","authenticated-orcid":false,"given":"Erik","family":"M\u00e5rtensson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,13]]},"reference":[{"key":"722_CR1","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing. STOC \u201905, pp. 84\u201393. Association for Computing Machinery, New York, NY, USA (2005). https:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"},{"key":"722_CR2","unstructured":"NIST: Post-Quantum Cryptography Standardization. https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization"},{"key":"722_CR3","doi-asserted-by":"crossref","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: Faster fully homomorphic encryption: Bootstrapping in less than 0.1 seconds. In: Cheon, J.H., Takagi, T. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2016, pp. 3\u201333. Springer, Berlin, Heidelberg (2016)","DOI":"10.1007\/978-3-662-53887-6_1"},{"issue":"2","key":"722_CR4","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10623-013-9864-x","volume":"74","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Cid, C., Faug\u00e8re, J., Fitzpatrick, R., Perret, L.: On the complexity of the BKW algorithm on LWE. Des. Codes Cryptogr. 74(2), 325\u2013354 (2015)","journal-title":"Des. Codes Cryptogr."},{"key":"722_CR5","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.) Automata, Languages and Programming, pp. 403\u2013415. Springer, Berlin, Heidelberg (2011)"},{"key":"722_CR6","first-page":"327","volume-title":"USENIX Security 2016: 25th USENIX Security Symposium","author":"E Alkim","year":"2016","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key exchange - A new hope. In: Holz, T., Savage, S. (eds.) USENIX Security 2016: 25th USENIX Security Symposium, pp. 327\u2013343. USENIX Association, Austin, TX, USA (2016)"},{"key":"722_CR7","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Regev, O.: In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Lattice-based Cryptography, pp. 147\u2013191. Springer, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-88702-7_5","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"722_CR8","doi-asserted-by":"publisher","unstructured":"Guo, Q., Johansson, T.: Faster dual lattice attacks for solving LWE with applications to CRYSTALS. In: Tibouchi, M., Wang, H. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02021, Part\u00a0IV. Lecture Notes in Computer Science, vol. 13093, pp. 33\u201362. Springer, Singapore (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_2","DOI":"10.1007\/978-3-030-92068-5_2"},{"key":"722_CR9","doi-asserted-by":"publisher","unstructured":"MATZOV: Report on the Security of LWE: Improved Dual Lattice Attack. Zenodo (2022). https:\/\/doi.org\/10.5281\/zenodo.6412487","DOI":"10.5281\/zenodo.6412487"},{"key":"722_CR10","unstructured":"Albrecht, M.R., Shen, Y.: Quantum Augmented Dual Attack. Cryptology ePrint Archive, Paper 2022\/656 (2022). https:\/\/eprint.iacr.org\/2022\/656"},{"key":"722_CR11","unstructured":"Glaser, T., May, A., Nowakowski, J.: Entropy Suffices for Key Guessing. Cryptology ePrint Archive, Paper 2023\/797 (2023). https:\/\/eprint.iacr.org\/2023\/797"},{"key":"722_CR12","doi-asserted-by":"publisher","unstructured":"Budroni, A., M\u00e5rtensson, E.: Improved estimation of key enumeration with applications to solving LWE. In: 2023 IEEE International Symposium on Information Theory (ISIT), pp. 495\u2013500 (2023). https:\/\/doi.org\/10.1109\/ISIT54713.2023.10206474","DOI":"10.1109\/ISIT54713.2023.10206474"},{"key":"722_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-031-38548-3_2","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"L Ducas","year":"2023","unstructured":"Ducas, L., Pulles, L.N.: Does the dual-sieve attack on learning with errors even work? In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology - CRYPTO 2023, pp. 37\u201369. Springer, Cham (2023)"},{"key":"722_CR14","unstructured":"Carrier, K., Shen, Y., Tillich, J.-P.: Faster Dual Lattice Attacks by Using Coding Theory. Cryptology ePrint Archive, Paper 2022\/1750. https:\/\/eprint.iacr.org\/2022\/1750 (2022)"},{"key":"722_CR15","unstructured":"Wiemers, A., Ehlen, S., Bashiri, K.: A remark on the Independence Heuristic in the Dual Attack. Cryptology ePrint Archive, Paper 2023\/1238 (2023). https:\/\/eprint.iacr.org\/2023\/1238"},{"key":"722_CR16","doi-asserted-by":"crossref","unstructured":"Pouly, A., Shen, Y.: Provable dual attacks on learning with errors. In: Advances in Cryptology \u2013 EUROCRYPT 2024 (2024)","DOI":"10.1007\/978-3-031-58754-2_10"},{"key":"722_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-48624-1_1","volume-title":"Theory of Cryptography","author":"C Meyer-Hilfiger","year":"2023","unstructured":"Meyer-Hilfiger, C., Tillich, J.-P.: Rigorous foundations for dual attacks in coding theory. In: Rothblum, G., Wee, H. (eds.) Theory of Cryptography, pp. 3\u201332. Springer, Cham (2023)"},{"key":"722_CR18","unstructured":"Ducas, L., Pulles, L.N.: Accurate Score Prediction for Dual-Sieve Attacks. Cryptology ePrint Archive, Paper 2023\/1850 (2023). https:\/\/eprint.iacr.org\/2023\/1850"},{"key":"722_CR19","doi-asserted-by":"crossref","unstructured":"Carrier, K., Debris-Alazard, T., Meyer-Hilfiger, C., Tillich, J.-P.: Reduction from sparse LPN to LPN, dual attack 3.0. In: Advances in Cryptology \u2013 EUROCRYPT 2024 (2024)","DOI":"10.1007\/978-3-031-58754-2_11"},{"key":"722_CR20","unstructured":"Bernstein, D.J.: Asymptotics of hybrid primal lattice attacks. Cryptology ePrint Archive, Paper 2023\/1892 (2023). https:\/\/eprint.iacr.org\/2023\/1892"},{"key":"722_CR21","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing. STOC \u201996, pp. 212\u2013219. Association for Computing Machinery, New York, NY, USA (1996). https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"722_CR22","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1090\/conm\/305\/05215","volume":"305","author":"G Brassard","year":"2002","unstructured":"Brassard, G., Hoyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. Contemp. Math. 305, 53\u201374 (2002)","journal-title":"Contemp. Math."},{"key":"722_CR23","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lovasz, L.: Factoring Polynomials with Rational Coefficients. Math. Ann. 261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"issue":"2","key":"722_CR24","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"CP Schnorr","year":"1987","unstructured":"Schnorr, C.P.: A hierarchy of polynomial time lattice basis reduction algorithms. Theor. Comput. Sci. 53(2), 201\u2013224 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"722_CR25","doi-asserted-by":"publisher","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: Better lattice security estimates. In: Lee, D.H., Wang, X. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02011. Lecture Notes in Computer Science, vol. 7073, pp. 1\u201320. Springer, Seoul, South Korea (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_1","DOI":"10.1007\/978-3-642-25385-0_1"},{"key":"722_CR26","doi-asserted-by":"publisher","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing. STOC \u201901, pp. 601\u2013610. Association for Computing Machinery, New York, NY, USA (2001). https:\/\/doi.org\/10.1145\/380752.380857","DOI":"10.1145\/380752.380857"},{"key":"722_CR27","doi-asserted-by":"crossref","unstructured":"Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. SODA \u201916, pp. 10\u201324. Society for Industrial and Applied Mathematics, USA (2016)","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"722_CR28","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10623-015-0067-5","volume":"77","author":"T Laarhoven","year":"2015","unstructured":"Laarhoven, T., Mosca, M., Pol, J.: Finding shortest lattice vectors faster using quantum search. Des. Codes Crypt. 77, 375\u2013400 (2015)","journal-title":"Des. Codes Crypt."},{"key":"722_CR29","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-92068-5_3","volume-title":"Advances in Cryptology - ASIACRYPT 2021","author":"A Chailloux","year":"2021","unstructured":"Chailloux, A., Loyer, J.: Lattice sieving via quantum random walks. In: Tibouchi, M., Wang, H. (eds.) Advances in Cryptology - ASIACRYPT 2021, pp. 63\u201391. Springer, Cham (2021)"},{"key":"722_CR30","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-031-30589-4_8","volume-title":"Advances in Cryptology - EUROCRYPT 2023","author":"X Bonnetain","year":"2023","unstructured":"Bonnetain, X., Chailloux, A., Schrottenloher, A., Shen, Y.: Finding many collisions via reusable quantum walks. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology - EUROCRYPT 2023, pp. 221\u2013251. Springer, Cham (2023)"},{"key":"722_CR31","doi-asserted-by":"publisher","unstructured":"Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) Advances in Cryptology \u2013 CRYPTO\u00a02009. Lecture Notes in Computer Science, vol. 5677, pp. 595\u2013618. Springer, Santa Barbara, CA, USA (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_35","DOI":"10.1007\/978-3-642-03356-8_35"},{"key":"722_CR32","unstructured":"Kirchner, P.: Improved Generalized Birthday Attack. Cryptology ePrint Archive, Report 2011\/377. https:\/\/eprint.iacr.org\/2011\/377 (2011)"},{"key":"722_CR33","doi-asserted-by":"crossref","unstructured":"Blum, A., Kalai, A.T., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. In: Symposium on the Theory of Computing (2000)","DOI":"10.1145\/335305.335355"},{"key":"722_CR34","doi-asserted-by":"publisher","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\u00a02014: 17th International Conference on Theory and Practice of Public Key Cryptography. Lecture Notes in Computer Science, vol. 8383, pp. 429\u2013445. Springer, Buenos Aires, Argentina (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_25","DOI":"10.1007\/978-3-642-54631-0_25"},{"key":"722_CR35","doi-asserted-by":"publisher","unstructured":"Guo, Q., Johansson, T., Stankovski, P.: Coded-BKW: Solving LWE using lattice codes. In: Gennaro, R., Robshaw, M.J.B. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02015, Part\u00a0I. Lecture Notes in Computer Science, vol. 9215, pp. 23\u201342. Springer, Santa Barbara, CA, USA (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_2","DOI":"10.1007\/978-3-662-47989-6_2"},{"key":"722_CR36","doi-asserted-by":"publisher","unstructured":"Kirchner, P., Fouque, P.-A.: An improved BKW algorithm for LWE with applications to cryptography and lattices. In: Gennaro, R., Robshaw, M.J.B. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02015, Part\u00a0I. Lecture Notes in Computer Science, vol. 9215, pp. 43\u201362. Springer, Santa Barbara, CA, USA (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_3","DOI":"10.1007\/978-3-662-47989-6_3"},{"key":"722_CR37","doi-asserted-by":"publisher","unstructured":"Guo, Q., Johansson, T., M\u00e5rtensson, E., Stankovski, P.: Coded-BKW with sieving. In: Takagi, T., Peyrin, T. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02017, Part\u00a0I. Lecture Notes in Computer Science, vol. 10624, pp. 323\u2013346. Springer, Hong Kong, China (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_12","DOI":"10.1007\/978-3-319-70694-8_12"},{"key":"722_CR38","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-030-65277-7_19","volume-title":"Progress in Cryptology - INDOCRYPT 2020","author":"A Budroni","year":"2020","unstructured":"Budroni, A., Guo, Q., Johansson, T., M\u00e5rtensson, E., Wagner, P.S.: Making the BKW algorithm practical for LWE. In: Bhargavan, K., Oswald, E., Prabhakaran, M. (eds.) Progress in Cryptology - INDOCRYPT 2020, pp. 417\u2013439. Springer, Cham (2020)"},{"key":"722_CR39","doi-asserted-by":"publisher","unstructured":"Budroni, A., Guo, Q., Johansson, T., M\u00e5rtensson, E., Wagner, P.S.: Improvements on making BKW practical for solving LWE. Cryptography. 5(4) (2021) https:\/\/doi.org\/10.3390\/cryptography5040031","DOI":"10.3390\/cryptography5040031"},{"key":"722_CR40","doi-asserted-by":"publisher","unstructured":"Massey, J.L.: Guessing and entropy. In: Proceedings of 1994 IEEE International Symposium on Information Theory, p. 204 (1994). https:\/\/doi.org\/10.1109\/ISIT.1994.394764","DOI":"10.1109\/ISIT.1994.394764"},{"key":"722_CR41","unstructured":"Wikipedia contributors: Multinomial distribution \u2014 Wikipedia, The Free Encyclopedia. accessed 2023-08-09 (2023). https:\/\/en.wikipedia.org\/wiki\/Multinomial_distribution"},{"key":"722_CR42","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-18073-6_7","volume-title":"Theory of Quantum Computation, Communication, and Cryptography","author":"A Montanaro","year":"2011","unstructured":"Montanaro, A.: Quantum search with advice. In: Dam, W., Kendon, V.M., Severini, S. (eds.) Theory of Quantum Computation, Communication, and Cryptography, pp. 77\u201393. Springer, Berlin, Heidelberg (2011)"},{"key":"722_CR43","unstructured":"Wikipedia contributors: Euler-Maclaurin formula \u2014 Wikipedia, The Free Encyclopedia. accessed 2023-01-10 (2023). https:\/\/en.wikipedia.org\/wiki\/Euler-Maclaurin_formula"},{"key":"722_CR44","doi-asserted-by":"crossref","unstructured":"T\u0103n\u0103sescu, A., Choudary, M.O., Rioul, O., Popescu, P.G.: Tight and scalable side-channel attack evaluations through asymptotically optimal Massey-like inequalities on guessing entropy. Cryptography. 23(11) (2021)","DOI":"10.3390\/e23111538"},{"issue":"5","key":"722_CR45","doi-asserted-by":"publisher","first-page":"2813","DOI":"10.1109\/TIT.2022.3141264","volume":"68","author":"O Rioul","year":"2022","unstructured":"Rioul, O.: Variations on a theme by Massey. IEEE Trans. Inf. Theory 68(5), 2813\u20132828 (2022). https:\/\/doi.org\/10.1109\/TIT.2022.3141264","journal-title":"IEEE Trans. Inf. Theory"},{"key":"722_CR46","doi-asserted-by":"publisher","unstructured":"Gidney, C., Eker\u00e5, M.: How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. Quantum. 5, 433 (2021) https:\/\/doi.org\/10.22331\/q-2021-04-15-433","DOI":"10.22331\/q-2021-04-15-433"},{"key":"722_CR47","unstructured":"TU Darmstadt Learning with Errors Challenge. https:\/\/www.latticechallenge.org\/lwe_challenge\/challenge.php. Accessed: 2023-01-24"},{"key":"722_CR48","doi-asserted-by":"publisher","unstructured":"Gama, N., Nguyen, P.Q., Regev, O.: Lattice enumeration using extreme pruning. In: Gilbert, H. (ed.) Advances in Cryptology \u2013 EUROCRYPT\u00a02010. Lecture Notes in Computer Science, vol. 6110, pp. 257\u2013278. Springer, French Riviera (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_13","DOI":"10.1007\/978-3-642-13190-5_13"},{"key":"722_CR49","doi-asserted-by":"publisher","unstructured":"Guo, Q., M\u00e5rtensson, E., Wagner, P.S.: On the sample complexity of solving LWE using BKW-style algorithms. In: 2021 IEEE International Symposium on Information Theory (ISIT), pp. 2405\u20132410 (2021). https:\/\/doi.org\/10.1109\/ISIT45174.2021.9518190","DOI":"10.1109\/ISIT45174.2021.9518190"},{"key":"722_CR50","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s12095-022-00597-0","volume":"15","author":"Q Guo","year":"2023","unstructured":"Guo, Q., M\u00e5rtensson, E., Stankovski Wagner, P.: Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms. Cryptogr. Commun. 15, 331\u2013350 (2023)","journal-title":"Cryptogr. Commun."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00722-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-024-00722-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00722-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T06:09:32Z","timestamp":1724652572000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-024-00722-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,13]]},"references-count":50,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["722"],"URL":"https:\/\/doi.org\/10.1007\/s12095-024-00722-1","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,13]]},"assertion":[{"value":"9 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}