{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T11:23:15Z","timestamp":1761218595516,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T00:00:00Z","timestamp":1688774400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T00:00:00Z","timestamp":1688774400000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10623-023-01254-0","type":"journal-article","created":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T05:01:26Z","timestamp":1688792486000},"page":"3581-3602","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved attacks against reduced-round Whirlwind"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4029-0746","authenticated-orcid":false,"given":"Congming","family":"Wei","sequence":"first","affiliation":[]},{"given":"Bingyou","family":"Dong","sequence":"additional","affiliation":[]},{"given":"Jialiang","family":"Hua","sequence":"additional","affiliation":[]},{"given":"Xiaoyang","family":"Dong","sequence":"additional","affiliation":[]},{"given":"Guoyan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,8]]},"reference":[{"key":"1254_CR1","doi-asserted-by":"publisher","unstructured":"AlTawy R., Youssef A.M.: Second preimage analysis of whirlwind. In: Lin D., Yung M., Zhou J. (eds.) Information Security and Cryptology\u201410th International Conference, Inscrypt 2014, Beijing, China, December 13\u201315, 2014, Revised Selected Papers. Lecture Notes in Computer Science, vol. 8957, pp. 311\u2013328 (2014). https:\/\/doi.org\/10.1007\/978-3-319-16745-9_17.","DOI":"10.1007\/978-3-319-16745-9_17"},{"key":"1254_CR2","doi-asserted-by":"publisher","unstructured":"Aoki K., Sasaki Y.: Preimage attacks on one-block md4, 63-step MD5 and more. In: Avanzi R.M., Keliher L., Sica F. (eds.) Selected Areas in Cryptography, 15th International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14\u201315, Revised Selected Papers. Lecture Notes in Computer Science, vol. 5381, pp. 103\u2013119 (2008). https:\/\/doi.org\/10.1007\/978-3-642-04159-4_7.","DOI":"10.1007\/978-3-642-04159-4_7"},{"key":"1254_CR3","doi-asserted-by":"publisher","unstructured":"Bao Z., Dong X., Guo J., Li Z., Shi D., Sun S., Wang X.: Automatic search of meet-in-the-middle preimage attacks on AES-like hashing. In: Canteaut A., Standaert F. (eds.) Advances in Cryptology\u2014EUROCRYPT 2021\u201440th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, October 17\u201321, 2021, Proceedings, Part I. Lecture Notes in Computer Science, vol. 12696, pp. 771\u2013804 (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_27.","DOI":"10.1007\/978-3-030-77870-5_27"},{"key":"1254_CR4","doi-asserted-by":"publisher","unstructured":"Bao Z., Guo J., Shi D., Tu Y.: Superposition meet-in-the-middle attacks: updates on fundamental security of AES-like hashing. In: Dodis Y., Shrimpton T. (eds.) Advances in Cryptology\u2014CRYPTO 2022\u201442nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15\u201318, 2022, Proceedings, Part I. Lecture Notes in Computer Science, vol. 13507, pp. 64\u201393 (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_3.","DOI":"10.1007\/978-3-031-15802-5_3"},{"issue":"2\u20133","key":"1254_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10623-010-9391-y","volume":"56","author":"PSLM Barreto","year":"2010","unstructured":"Barreto P.S.L.M., Nikov V., Nikova S., Rijmen V., Tischhauser E.: Whirlwind: a new cryptographic hash function. Des. Codes Cryptogr. 56(2\u20133), 141\u2013162 (2010). https:\/\/doi.org\/10.1007\/s10623-010-9391-y.","journal-title":"Des. Codes Cryptogr."},{"key":"1254_CR6","first-page":"105","volume":"9","author":"DJ Bernstein","year":"2009","unstructured":"Bernstein D.J.: Cost analysis of hash collisions: will quantum computers make SHARCS obsolete. SHARCS 9, 105 (2009).","journal-title":"SHARCS"},{"key":"1254_CR7","doi-asserted-by":"publisher","unstructured":"Bouillaguet C., Derbez P., Fouque P.: Automatic search of attacks on round-reduced AES and applications. In: Rogaway P. (ed.) Advances in Cryptology\u2014CRYPTO 2011\u201431st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14\u201318, 2011. Proceedings. Lecture Notes in Computer Science, vol. 6841, pp. 169\u2013187 (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_10.","DOI":"10.1007\/978-3-642-22792-9_10"},{"key":"1254_CR8","doi-asserted-by":"crossref","unstructured":"Brassard G., H\u00f8yer P., Tapp A.: Quantum cryptanalysis of hash and claw-free functions. In: LATIN \u201998, Campinas, Brazil, April, 20\u201324, 1998, Proceedings, pp. 163\u2013169 (1998).","DOI":"10.1007\/BFb0054319"},{"key":"1254_CR9","doi-asserted-by":"publisher","unstructured":"Brassard G., Hoyer P., Mosca M., Tapp A.: Quantum amplitude amplification and estimation. In: AMS Contemporary Mathematics Series, vol. 305 (2000). https:\/\/doi.org\/10.1090\/conm\/305\/05215.","DOI":"10.1090\/conm\/305\/05215"},{"key":"1254_CR10","doi-asserted-by":"crossref","unstructured":"Chailloux A., Naya-Plasencia M., Schrottenloher A.: An efficient quantum collision search algorithm and implications on symmetric cryptography. In: ASIACRYPT 2017, Hong Kong, China, December 3\u20137, 2017, Proceedings, Part II, pp. 211\u2013240 (2017).","DOI":"10.1007\/978-3-319-70697-9_8"},{"key":"1254_CR11","doi-asserted-by":"publisher","unstructured":"Derbez P., Fouque P.: Automatic search of meet-in-the-middle and impossible differential attacks. In: Robshaw M., Katz J. (eds.) Advances in Cryptology\u2014CRYPTO 2016\u201436th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14\u201318, 2016, Proceedings, Part II. Lecture Notes in Computer Science, vol. 9815, pp. 157\u2013184 (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_6.","DOI":"10.1007\/978-3-662-53008-5_6"},{"key":"1254_CR12","doi-asserted-by":"publisher","unstructured":"Dong B., Liu T., Cui Y., Ni B., Qin L., Dong X.: Improved quantum collision attack on 5-round gr\u00f8stl-512. J. Cryptol. Res. 8(6), 974 (2021). https:\/\/doi.org\/10.13868\/j.cnki.jcr.000491.","DOI":"10.13868\/j.cnki.jcr.000491"},{"key":"1254_CR13","doi-asserted-by":"crossref","unstructured":"Dong X.Y., Sun S.W., Shi D.P., Gao F., Wang X.Y., Hu L.: Quantum collision attacks on AES-like hashing with low quantum random access memories. In: Moriai S., Wang H. (eds.) Advances in Cryptology\u2014ASIACRYPT 2020\u201426th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7\u201311, 2020, Proceedings, Part II. Lecture Notes in Computer Science, vol. 12492, pp. 727\u2013757 (2020).","DOI":"10.1007\/978-3-030-64834-3_25"},{"key":"1254_CR14","doi-asserted-by":"publisher","unstructured":"Dong X., Hua J., Sun S., Li Z., Wang X., Hu L.: Meet-in-the-middle attacks revisited: Key-recovery, collision, and preimage attacks. In: Malkin T., Peikert C. (eds.) Advances in Cryptology\u2014CRYPTO 2021\u201441st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16\u201320, 2021, Proceedings, Part III. Lecture Notes in Computer Science, vol. 12827, pp. 278\u2013308 (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_10.","DOI":"10.1007\/978-3-030-84252-9_10"},{"key":"1254_CR15","doi-asserted-by":"publisher","unstructured":"Fuhr T., Minaud B.: Match box meet-in-the-middle attack against KATAN. In: Cid C., Rechberger C. (eds.) Fast Software Encryption\u201421st International Workshop, FSE 2014, London, UK, March 3\u20135, 2014. Revised Selected Papers. Lecture Notes in Computer Science, vol. 8540, pp. 61\u201381 (2014). https:\/\/doi.org\/10.1007\/978-3-662-46706-0_4.","DOI":"10.1007\/978-3-662-46706-0_4"},{"key":"1254_CR16","doi-asserted-by":"crossref","unstructured":"Gilbert H., Peyrin T.: Super-sbox cryptanalysis: Improved attacks for AES-like permutations. In: FSE 2010, Seoul, Korea, February 7\u201310, 2010, pp. 365\u2013383 (2010).","DOI":"10.1007\/978-3-642-13858-4_21"},{"issue":"5","key":"1254_CR17","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.78.052310","volume":"78","author":"V Giovannetti","year":"2008","unstructured":"Giovannetti V., Lloyd S., Maccone L.: Architectures for a quantum random access memory. Phys. Rev. A 78(5), 052310 (2008). https:\/\/doi.org\/10.1103\/physreva.78.052310.","journal-title":"Phys. Rev. A"},{"issue":"16","key":"1254_CR18","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(16), 160501 (2008). https:\/\/doi.org\/10.1103\/physrevlett.100.160501.","journal-title":"Phys. Rev. Lett."},{"key":"1254_CR19","doi-asserted-by":"crossref","unstructured":"Grover L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22\u201324, 1996, pp. 212\u2013219 (1996).","DOI":"10.1145\/237814.237866"},{"key":"1254_CR20","doi-asserted-by":"publisher","unstructured":"Hosoyamada A., Sasaki Y.: Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound. In: Canteaut A., Ishai Y. (eds.) Advances in Cryptology\u2014EUROCRYPT 2020\u201439th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10\u201314, 2020, Proceedings, Part II. Lecture Notes in Computer Science, vol. 12106, pp. 249\u2013279 (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_9.","DOI":"10.1007\/978-3-030-45724-2_9"},{"key":"1254_CR21","doi-asserted-by":"publisher","unstructured":"Hosoyamada A., Sasaki Y.: Quantum collision attacks on reduced SHA-256 and SHA-512. In: Malkin T., Peikert C. (eds.) Advances in Cryptology\u2014CRYPTO 2021\u201441st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16\u201320, 2021, Proceedings, Part I. Lecture Notes in Computer Science, vol. 12825, pp. 616\u2013646 (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_22.","DOI":"10.1007\/978-3-030-84242-0_22"},{"key":"1254_CR22","doi-asserted-by":"publisher","unstructured":"Hosoyamada A., Naya-Plasencia M., Sasaki Y.: Improved attacks on SLISCP permutation and tight bound of limited birthday distinguishers. IACR Trans. Symmetric Cryptol. 2020(4), 147\u2013172 (2020). https:\/\/doi.org\/10.46586\/tosc.v2020.i4.147-172.","DOI":"10.46586\/tosc.v2020.i4.147-172"},{"key":"1254_CR23","doi-asserted-by":"publisher","unstructured":"Hua J., Dong X., Sun S., Zhang Z., Hu L., Wang X.: Improved MITM cryptanalysis on Streebog. IACR Trans. Symmetric Cryptol. 2022(2), 63\u201391 (2022). https:\/\/doi.org\/10.46586\/tosc.v2022.i2.63-91.","DOI":"10.46586\/tosc.v2022.i2.63-91"},{"key":"1254_CR24","doi-asserted-by":"publisher","unstructured":"Iwamoto M., Peyrin T., Sasaki Y.: Limited-birthday distinguishers for hash functions\u2014collisions beyond the birthday bound can be meaningful. In: Sako K., Sarkar P. (eds.) Advances in Cryptology\u2014ASIACRYPT 2013\u201419th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India, December 1\u20135, 2013, Proceedings, Part II. Lecture Notes in Computer Science, vol. 8270, pp. 504\u2013523 (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_26.","DOI":"10.1007\/978-3-642-42045-0_26"},{"key":"1254_CR25","doi-asserted-by":"crossref","unstructured":"Jean J., Naya-Plasencia M., Peyrin T.: Improved rebound attack on the finalist gr\u00f8stl. In: FSE 2012, Washington, DC, USA, March 19\u201321, 2012, pp. 110\u2013126 (2012).","DOI":"10.1007\/978-3-642-34047-5_7"},{"key":"1254_CR26","doi-asserted-by":"crossref","unstructured":"Kaplan M., Leurent G., Leverrier A., Naya-Plasencia M.: Breaking symmetric cryptosystems using quantum period finding. In: CRYPTO 2016, Santa Barbara, CA, USA, August 14\u201318, 2016, Proceedings, Part II, pp. 207\u2013237 (2016).","DOI":"10.1007\/978-3-662-53008-5_8"},{"key":"1254_CR27","doi-asserted-by":"publisher","unstructured":"Khovratovich D., Rechberger C., Savelieva A.: Bicliques for preimages: attacks on skein-512 and the SHA-2 family. In: Canteaut A. (ed.) Fast Software Encryption\u201419th International Workshop, FSE 2012, Washington, DC, USA, March 19\u201321, 2012. Revised Selected Papers. Lecture Notes in Computer Science, vol. 7549, pp. 244\u2013263 (2012). https:\/\/doi.org\/10.1007\/978-3-642-34047-5_15.","DOI":"10.1007\/978-3-642-34047-5_15"},{"key":"1254_CR28","doi-asserted-by":"crossref","unstructured":"Kuwakado H., Morii M.: Quantum distinguisher between the 3-round Feistel cipher and the random permutation. In: ISIT 2010, June 13\u201318, 2010, Austin, Texas, USA, Proceedings, pp. 2682\u20132685 (2010).","DOI":"10.1109\/ISIT.2010.5513654"},{"key":"1254_CR29","unstructured":"Kuwakado H., Morii M.: Security on the quantum-type even-Mansour cipher. In: ISITA 2012, Honolulu, HI, USA, October 28\u201331, 2012, pp. 312\u2013316 (2012)."},{"key":"1254_CR30","doi-asserted-by":"crossref","unstructured":"Lamberger M., Mendel F., Rechberger C., Rijmen V., Schl\u00e4ffer M.: Rebound distinguishers: results on the full whirlpool compression function. In: ASIACRYPT 2009, Tokyo, Japan, December 6\u201310, 2009. Proceedings, pp. 126\u2013143 (2009).","DOI":"10.1007\/978-3-642-10366-7_8"},{"key":"1254_CR31","doi-asserted-by":"publisher","unstructured":"Ma B., Li B., Hao R., Li X.: Cryptanalysis of reduced-round whirlwind. In: Foo E., Stebila D. (eds.) Information Security and Privacy\u201420th Australasian Conference, ACISP 2015, Brisbane, QLD, Australia, June 29\u2013July 1, 2015, Proceedings. Lecture Notes in Computer Science, vol. 9144, pp. 20\u201338 (2015). https:\/\/doi.org\/10.1007\/978-3-319-19962-7_2.","DOI":"10.1007\/978-3-319-19962-7_2"},{"key":"1254_CR32","doi-asserted-by":"crossref","unstructured":"Mendel F., Rechberger C., Schl\u00e4ffer M., Thomsen S.S.: The rebound attack: cryptanalysis of reduced whirlpool and gr\u00f8stl. In: FSE 2009, Leuven, Belgium, February 22\u201325, 2009, pp. 260\u2013276 (2009).","DOI":"10.1007\/978-3-642-03317-9_16"},{"key":"1254_CR33","doi-asserted-by":"publisher","unstructured":"Sasaki Y.: Integer linear programming for three-subset meet-in-the-middle attacks: application to GIFT. In: Inomata A., Yasuda K. (eds.) Advances in Information and Computer Security\u201413th International Workshop on Security, IWSEC 2018, Sendai, Japan, September 3\u20135, 2018, Proceedings. Lecture Notes in Computer Science, vol. 11049, pp. 227\u2013243 (2018). https:\/\/doi.org\/10.1007\/978-3-319-97916-8_15.","DOI":"10.1007\/978-3-319-97916-8_15"},{"key":"1254_CR34","doi-asserted-by":"publisher","unstructured":"Sasaki Y., Aoki K.: Preimage attacks on 3, 4, and 5-pass HAVAL. In: Pieprzyk J. (ed.) Advances in Cryptology\u2014ASIACRYPT 2008, 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, December 7\u201311, 2008. Proceedings. Lecture Notes in Computer Science, vol. 5350, pp. 253\u2013271 (2008). https:\/\/doi.org\/10.1007\/978-3-540-89255-7_16.","DOI":"10.1007\/978-3-540-89255-7_16"},{"key":"1254_CR35","doi-asserted-by":"publisher","unstructured":"Sasaki Y., Aoki K.: Finding preimages in full MD5 faster than exhaustive search. In: Joux A. (ed.) Advances in Cryptology\u2014EUROCRYPT 2009, 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cologne, Germany, April 26\u201330, 2009. Proceedings. Lecture Notes in Computer Science, vol. 5479, pp. 134\u2013152 (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_8.","DOI":"10.1007\/978-3-642-01001-9_8"},{"key":"1254_CR36","doi-asserted-by":"publisher","unstructured":"Sasaki Y., Li Y., Wang L., Sakiyama K., Ohta K.: Non-full-active super-sbox analysis: applications to ECHO and gr\u00f8stl. In: Abe M. (ed.) Advances in Cryptology\u2014ASIACRYPT 2010\u201416th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 5\u20139, 2010. Proceedings. Lecture Notes in Computer Science, vol. 6477, pp. 38\u201355 (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_3.","DOI":"10.1007\/978-3-642-17373-8_3"},{"key":"1254_CR37","doi-asserted-by":"crossref","unstructured":"Sasaki Y., Wang L., Wu S., Wu W.: Investigating fundamental security requirements on whirlpool: improved preimage and collision attacks. In: Wang X., Sako K. (eds.) Advances in Cryptology\u2014ASIACRYPT 2012\u201418th International Conference on the Theory and Application of Cryptology and Information Security, Beijing, China, December 2\u20136, 2012, Proceedings, pp. 562\u2013579 (2012).","DOI":"10.1007\/978-3-642-34961-4_34"},{"key":"1254_CR38","doi-asserted-by":"publisher","unstructured":"Schrottenloher A., Stevens M.: Simplified MITM modeling for permutations: new (quantum) attacks. In: Dodis Y., Shrimpton T. (eds.) Advances in Cryptology\u2014CRYPTO 2022\u201442nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15\u201318, 2022, Proceedings, Part III. Lecture Notes in Computer Science, vol. 13509, pp. 717\u2013747 (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_24.","DOI":"10.1007\/978-3-031-15982-4_24"},{"issue":"5","key":"1254_CR39","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997). https:\/\/doi.org\/10.1137\/S0097539795293172.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1254_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"PC van Oorschot","year":"1999","unstructured":"van Oorschot P.C., Wiener M.J.: Parallel collision search with cryptanalytic applications. J. Cryptol. 12(1), 1\u201328 (1999). https:\/\/doi.org\/10.1007\/PL00003816.","journal-title":"J. Cryptol."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01254-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01254-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01254-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T19:15:48Z","timestamp":1698174948000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01254-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,8]]},"references-count":40,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1254"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01254-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2023,7,8]]},"assertion":[{"value":"15 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}