{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T10:22:11Z","timestamp":1768818131918,"version":"3.49.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T00:00:00Z","timestamp":1723248000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T00:00:00Z","timestamp":1723248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Science Foundation","award":["2122229"],"award-info":[{"award-number":["2122229"]}]},{"name":"National Science Foundation","award":["2122229"],"award-info":[{"award-number":["2122229"]}]},{"name":"National Science Foundation","award":["2122229"],"award-info":[{"award-number":["2122229"]}]},{"DOI":"10.13039\/100009226","name":"National Security Agency","doi-asserted-by":"publisher","award":["H98230-22-1-0328"],"award-info":[{"award-number":["H98230-22-1-0328"]}],"id":[{"id":"10.13039\/100009226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10623-024-01473-z","type":"journal-article","created":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T17:02:09Z","timestamp":1723309329000},"page":"3895-3918","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An algebraic algorithm for breaking NTRU with multiple keys"],"prefix":"10.1007","volume":"92","author":[{"given":"Shi","family":"Bai","sequence":"first","affiliation":[]},{"given":"Hansraj","family":"Jangir","sequence":"additional","affiliation":[]},{"given":"Tran","family":"Ngo","sequence":"additional","affiliation":[]},{"given":"William","family":"Youmans","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,10]]},"reference":[{"key":"1473_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-17653-2_7","volume-title":"EUROCRYPT 2019, Part I, LNCS","author":"S Agrawal","year":"2019","unstructured":"Agrawal S.: Indistinguishability obfuscation without multilinear maps: New methods for bootstrapping and instantiation. In: Ishai Y., Rijmen V. (eds.) EUROCRYPT 2019, Part I, LNCS, vol. 11476, pp. 191\u2013225. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_7."},{"key":"1473_CR2","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-030-45721-1_5","volume-title":"EUROCRYPT 2020, Part I, LNCS","author":"S Agrawal","year":"2020","unstructured":"Agrawal S., Pellet-Mary A.: Indistinguishability obfuscation without maps: Attacks and fixes for noisy linear FE. In: Canteaut A., Ishai Y. (eds.) EUROCRYPT 2020, Part I, LNCS, vol. 12105, pp. 110\u2013140. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_5."},{"key":"1473_CR3","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1145\/237814.237838","volume-title":"28th ACM STOC","author":"M Ajtai","year":"1996","unstructured":"Ajtai M.: Generating hard instances of lattice problems (extended abstract). In: 28th ACM STOC, pp. 99\u2013108. ACM Press, USA (1996). https:\/\/doi.org\/10.1145\/237814.237838."},{"issue":"2","key":"1473_CR4","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/2815111.2815158","volume":"49","author":"MR Albrecht","year":"2015","unstructured":"Albrecht M.R., Cid C., Faug\u00e8re J.C., et al.: Algebraic algorithms for lwe problems. ACM Commun. Comput. Algebra 49(2), 62 (2015). https:\/\/doi.org\/10.1145\/2815111.2815158.","journal-title":"ACM Commun. Comput. Algebra"},{"key":"1473_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-662-53018-4_6","volume-title":"CRYPTO 2016, Part I, LNCS","author":"MR Albrecht","year":"2016","unstructured":"Albrecht M.R., Bai S., Ducas L.: A subfield lattice attack on overstretched NTRU assumptions-cryptanalysis of some FHE and graded encoding schemes. In: Robshaw M., Katz J. (eds.) CRYPTO 2016, Part I, LNCS, vol. 9814, pp. 153\u2013178. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_6."},{"key":"1473_CR6","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-319-70694-8_11","volume-title":"ASIACRYPT 2017, Part I, LNCS","author":"MR Albrecht","year":"2017","unstructured":"Albrecht M.R., G\u00f6pfert F., Virdia F., et al.: Revisiting the expected cost of solving uSVP and applications to LWE. In: Takagi T., Peyrin T. (eds.) ASIACRYPT 2017, Part I, LNCS, vol. 10624, pp. 297\u2013322. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_11."},{"key":"1473_CR7","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-22006-7_34","volume-title":"ICALP 2011, Part I, LNCS","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":"1473_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-031-22301-3_15","volume-title":"ACISP 22, LNCS","author":"S Bai","year":"2022","unstructured":"Bai S., Beard A., Johnson F., et al.: Fiat-shamir signatures based on module-NTRU. In: Nguyen K., Yang G., Guo F., et al. (eds.) ACISP 22, LNCS, vol. 13494, pp. 289\u2013308. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22301-3_15."},{"key":"1473_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-72565-9_12","volume-title":"SAC 2017, LNCS","author":"DJ Bernstein","year":"2017","unstructured":"Bernstein D.J., Chuengsatiansup C., Lange T., et al.: NTRU prime: Reducing attack surface at low cost. In: Adams C., Camenisch J. (eds.) SAC 2017, LNCS, vol. 10719, pp. 235\u2013260. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-72565-9_12."},{"key":"1473_CR10","unstructured":"Bernstein D.J., Brumley B.B., Chen M.S., et\u00a0al.: NTRU Prime. Tech. rep., National Institute of Standards and Technology, (2020). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-3-submissions."},{"key":"1473_CR11","unstructured":"Chen C., Danba O., Hoffstein J., et\u00a0al.: NTRU. Tech. rep., National Institute of Standards and Technology, (2020). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-3-submissions."},{"key":"1473_CR12","unstructured":"Cheon J.H., Jeong J., Lee C.: An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low level encoding of zero. Cryptology ePrint Archive, Report 2016\/139, (2016). https:\/\/eprint.iacr.org\/2016\/139."},{"key":"1473_CR13","unstructured":"Cheon J.H., Kim D., Kim T., et\u00a0al.: A new trapdoor over module-NTRU lattice and its application to ID-based encryption. Cryptology ePrint Archive, Report 2019\/1468, (2019). https:\/\/eprint.iacr.org\/2019\/1468."},{"key":"1473_CR14","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-69053-0_5","volume-title":"EUROCRYPT\u201997, LNCS","author":"D Coppersmith","year":"1997","unstructured":"Coppersmith D., Shamir A.: Lattice attacks on NTRU. In: Fumy W. (ed.) EUROCRYPT\u201997, LNCS, vol. 1233, pp. 52\u201361. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_5."},{"key":"1473_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-92068-5_1","volume-title":"ASIACRYPT 2021, Part IV, LNCS","author":"L Ducas","year":"2021","unstructured":"Ducas L., van Woerden W.P.J.: NTRU fatigue: how stretched is overstretched? In: Tibouchi M., Wang H. (eds.) ASIACRYPT 2021, Part IV, LNCS, vol. 13093, pp. 3\u201332. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_1."},{"key":"1473_CR16","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-78967-3_3","volume-title":"EUROCRYPT 2008, LNCS","author":"N Gama","year":"2008","unstructured":"Gama N., Nguyen P.Q.: Predicting lattice reduction. In: Smart N.P. (ed.) EUROCRYPT 2008, LNCS, vol. 4965, pp. 31\u201351. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_3."},{"key":"1473_CR17","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-46035-7_20","volume-title":"EUROCRYPT 2002, LNCS","author":"C Gentry","year":"2002","unstructured":"Gentry C., Szydlo M.: Cryptanalysis of the revised NTRU signature scheme. In: Knudsen L.R. (ed.) EUROCRYPT 2002, LNCS, vol. 2332, pp. 299\u2013320. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_20."},{"key":"1473_CR18","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-642-22792-9_25","volume-title":"CRYPTO 2011, LNCS","author":"G Hanrot","year":"2011","unstructured":"Hanrot G., Pujol X., Stehl\u00e9 D.: Analyzing blockwise lattice algorithms using dynamical systems. In: Rogaway P. (ed.) CRYPTO 2011, LNCS, vol. 6841, pp. 447\u2013464. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_25."},{"key":"1473_CR19","volume-title":"An Introduction to the Theory of Numbers","author":"GH Hardy","year":"1975","unstructured":"Hardy G.H., Wright E.M.: An Introduction to the Theory of Numbers, 4th edn Oxford University Press, Oxford (1975).","edition":"4"},{"key":"1473_CR20","unstructured":"Hoffstein J., Pipher J., Silverman J.H.: NTRU: a new high speed public key cryptosystem draft from CRYPTO \u201996 rump session, put online in 2016, (1996). https:\/\/web.securityinnovation.com\/hubfs\/files\/ntru-orig.pdf."},{"key":"1473_CR21","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.) Algorithmic Number Theory, pp. 267\u2013288. Springer, Berlin Heidelberg, Berlin, Heidelberg (1998)."},{"key":"1473_CR22","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-44987-6_14","volume-title":"EUROCRYPT 2001, LNCS","author":"J Hoffstein","year":"2001","unstructured":"Hoffstein J., Pipher J., Silverman J.H.: NSS: An NTRU lattice-based signature scheme. In: Pfitzmann B. (ed.) EUROCRYPT 2001, LNCS, vol. 2045, pp. 211\u2013228. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_14."},{"key":"1473_CR23","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-36563-X_9","volume-title":"CT-RSA 2003, LNCS","author":"J Hoffstein","year":"2003","unstructured":"Hoffstein J., Howgrave-Graham N., Pipher J., et al.: NTRUSIGN: Digital signatures using the NTRU lattice. In: Joye M. (ed.) CT-RSA 2003, LNCS, vol. 2612, pp. 122\u2013140. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36563-X_9."},{"key":"1473_CR24","unstructured":"Hoffstein J., Silverman J.H., Whyte W.: Meet-in-the-middle attack on an ntru private key. Technical report, NTRU Cryptosystems, July 2006, (2006). http:\/\/www.ntru.com."},{"key":"1473_CR25","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-74143-5_9","volume-title":"CRYPTO 2007, LNCS","author":"N Howgrave-Graham","year":"2007","unstructured":"Howgrave-Graham N.: A hybrid lattice-reduction and meet-in-the-middle attack against NTRU. In: Menezes A. (ed.) CRYPTO 2007, LNCS, vol. 4622, pp. 150\u2013169. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_9."},{"key":"1473_CR26","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-52153-4_1","volume-title":"CT-RSA 2017, LNCS","author":"J Hoffstein","year":"2017","unstructured":"Hoffstein J., Pipher J., Schanck J.M., et al.: Choosing parameters for NTRUEncrypt. In: Handschuh H. (ed.) CT-RSA 2017, LNCS, vol. 10159, pp. 3\u201318. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-52153-4_1."},{"key":"1473_CR27","unstructured":"Kim J., Lee C.: Personal communication (2023)."},{"issue":"8","key":"1473_CR28","doi-asserted-by":"publisher","first-page":"2779","DOI":"10.1007\/s10623-023-01233-5","volume":"91","author":"J Kim","year":"2023","unstructured":"Kim J., Lee C.: A polynomial time algorithm for breaking NTRU encryption with multiple keys. Des. Codes Cryptogr. 91(8), 2779\u20132789 (2023). https:\/\/doi.org\/10.1007\/s10623-023-01233-5.","journal-title":"Des. Codes Cryptogr."},{"key":"1473_CR29","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-56620-7_1","volume-title":"EUROCRYPT 2017, Part I, LNCS","author":"P Kirchner","year":"2017","unstructured":"Kirchner P., Fouque P.A.: Revisiting lattice attacks on overstretched NTRU parameters. In: Coron J.S., Nielsen J.B. (eds.) EUROCRYPT 2017, Part I, LNCS, vol. 10210, pp. 3\u201326. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_1."},{"key":"1473_CR30","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-319-78381-9_8","volume-title":"EUROCRYPT 2018, Part I, LNCS","author":"V Lyubashevsky","year":"2018","unstructured":"Lyubashevsky V., Seiler G.: Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs. In: Nielsen J.B., Rijmen V. (eds.) EUROCRYPT 2018, Part I, LNCS, vol. 10820, pp. 204\u2013224. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_8."},{"issue":"3","key":"1473_CR31","doi-asserted-by":"publisher","first-page":"180","DOI":"10.13154\/tches.v2019.i3.180-201","volume":"2019","author":"V Lyubashevsky","year":"2019","unstructured":"Lyubashevsky V., Seiler G.: NTTRU: truly fast NTRU using NTT. IACR TCHES 2019(3), 180\u2013201 (2019). https:\/\/doi.org\/10.13154\/tches.v2019.i3.180-201.","journal-title":"IACR TCHES"},{"key":"1473_CR32","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-030-75245-3_9","volume-title":"PKC 2021, Part I, LNCS","author":"V Lyubashevsky","year":"2021","unstructured":"Lyubashevsky V., Nguyen N.K., Seiler G.: Shorter lattice-based zero-knowledge proofs via one-time commitments. In: Garay J. (ed.) PKC 2021, Part I, LNCS, vol. 12710, pp. 215\u2013241. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_9."},{"key":"1473_CR33","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/FOCS.2004.72","volume-title":"45th FOCS","author":"D Micciancio","year":"2004","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."},{"issue":"2","key":"1473_CR34","first-page":"112","volume":"16","author":"A Nitaj","year":"2014","unstructured":"Nitaj A.: Cryptanalysis of NTRU with two public keys. Int. J. Netw. Secur. 16(2), 112\u2013117 (2014).","journal-title":"Int. J. Netw. Secur."},{"key":"1473_CR35","unstructured":"Peikert C.: Multiple ntru public keys for the same private key? (2015) https:\/\/crypto.stackexchange.com\/questions\/30893\/multiple-ntru-public-keys-for-the-same-private-key."},{"issue":"4","key":"1473_CR36","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1561\/0400000074","volume":"10","author":"C Peikert","year":"2016","unstructured":"Peikert C.: A decade of lattice cryptography. Found. Trends Theor. Comput. Sci. 10(4), 283\u2013424 (2016). https:\/\/doi.org\/10.1561\/0400000074.","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"1473_CR37","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-92062-3_1","volume-title":"ASIACRYPT 2021, Part I, LNCS","author":"A Pellet-Mary","year":"2021","unstructured":"Pellet-Mary A., Stehl\u00e9 D.: On the hardness of the NTRU problem. In: Tibouchi M., Wang H. (eds.) ASIACRYPT 2021, Part I, LNCS, vol. 13090, pp. 3\u201335. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_1."},{"key":"1473_CR38","unstructured":"Prest T., Fouque P.A., Hoffstein J., et\u00a0al.: FALCON. Tech. rep., National Institute of Standards and Technology, (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022."},{"key":"1473_CR39","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/1060590.1060603","volume-title":"37th ACM STOC","author":"O Regev","year":"2005","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":"1473_CR40","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/11818175_8","volume-title":"CRYPTO 2006, LNCS","author":"O Regev","year":"2006","unstructured":"Regev O.: Lattice-based cryptography (invited talk). In: Dwork C. (ed.) CRYPTO 2006, LNCS, vol. 4117, pp. 131\u2013141. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_8."},{"issue":"2\u20133","key":"1473_CR41","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C Schnorr","year":"1987","unstructured":"Schnorr C.: A hierarchy of polynomial time lattice basis reduction algorithms. Theor. Comput. Sci. 53(2\u20133), 201\u2013224 (1987).","journal-title":"Theor. Comput. Sci."},{"key":"1473_CR42","doi-asserted-by":"publisher","unstructured":"Singh S., Padhye S.: Cryptanalysis of ntru with n public keys. In: 2017 ISEA Asia Security and Privacy (ISEASP), pp. 1\u20136. (2017). https:\/\/doi.org\/10.1109\/ISEASP.2017.7976980.","DOI":"10.1109\/ISEASP.2017.7976980"},{"key":"1473_CR43","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-20465-4_4","volume-title":"EUROCRYPT 2011, LNCS","author":"D Stehl\u00e9","year":"2011","unstructured":"Stehl\u00e9 D., Steinfeld R.: Making NTRU as secure as worst-case problems over ideal lattices. In: Paterson K.G. (ed.) EUROCRYPT 2011, LNCS, vol. 6632, pp. 27\u201347. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_4."},{"key":"1473_CR44","unstructured":"Team TF.: FLINT: Fast Library for Number Theory. Version 2.9.0, (2023). https:\/\/flintlib.org."},{"key":"1473_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2022.106353","author":"Z Zhao","year":"2023","unstructured":"Zhao Z., Ye Q.: Revisiting lower dimension lattice attacks on ntru. Inf. Process Lett. (2023). https:\/\/doi.org\/10.1016\/j.ipl.2022.106353.","journal-title":"Inf. Process Lett."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01473-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01473-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01473-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T21:23:54Z","timestamp":1732310634000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01473-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,10]]},"references-count":45,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1473"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01473-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,10]]},"assertion":[{"value":"14 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}