{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T01:06:17Z","timestamp":1759799177410,"version":"build-2065373602"},"reference-count":58,"publisher":"International Association for Cryptologic Research","issue":"3","license":[{"start":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T00:00:00Z","timestamp":1751932800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IACR CiC"],"accepted":{"date-parts":[[2025,9,2]]},"abstract":"<jats:p>In this paper, we explore the potential of improving AES-based schemes by integrating SHA instructions alongside AES instructions, starting from the key observation that SHA instructions can be executed in parallel with AES instructions on modern processors. We investigate conditions for parallel execution, the invocation ratio, and overhead of type conversions, and then provide guidelines for efficient SHA instruction usage with AES instructions. Applying these guidelines, we integrate SHA round functions into the AES-based short-input hash functions of Simpira and Areion, resulting in approximately 50% faster performance by achieving security with fewer iterations. Besides, we apply integration of SHA instructions to AES-based AEAD schemes of AEGIS-128L,  which supports a 256-bit tag but has recently been shown to fall short of providing full 256-bit forgery security. We demonstrate that hybrid schemes can achieve 256-bit forgery security for AEGIS-128L while preserving performance. <\/jats:p>","DOI":"10.62056\/anxrudy6b","type":"journal-article","created":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T18:49:52Z","timestamp":1759776592000},"update-policy":"https:\/\/doi.org\/10.62056\/adfjwm02dj","source":"Crossref","is-referenced-by-count":0,"title":["Exploring SHA Instructions and Its Application to AES-based Schemes"],"prefix":"10.62056","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5275-335X","authenticated-orcid":false,"given":"Takuro","family":"Shiraya","sequence":"first","affiliation":[{"id":[{"id":"https:\/\/ror.org\/035t8zc32","id-type":"ROR","asserted-by":"publisher"}],"name":"The University of Osaka","place":["1-5 Yamadaoka, Suita, Osaka, 565-0871, Japan"]}]},{"given":"Subhadeep","family":"Banik","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/03c4atk17","id-type":"ROR","asserted-by":"publisher"}],"name":"University of Lugano","place":["Lugano, Switzerland"]}]},{"given":"Tatsuya","family":"Ishikawa","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/035t8zc32","id-type":"ROR","asserted-by":"publisher"}],"name":"The University of Osaka","place":["1-5 Yamadaoka, Suita, Osaka, 565-0871, Japan"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4929-8974","authenticated-orcid":false,"given":"Ryoma","family":"Ito","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/016bgq349","id-type":"ROR","asserted-by":"publisher"}],"name":"National Institute of Information and Communications Technology","place":["Koganei, Japan"]},{"id":[{"id":"https:\/\/ror.org\/035t8zc32","id-type":"ROR","asserted-by":"publisher"}],"name":"The University of Osaka","place":["1-5 Yamadaoka, Suita, Osaka, 565-0871, Japan"]}]},{"given":"Mostafizar","family":"Rahman","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/02kpeqv85","id-type":"ROR","asserted-by":"publisher"}],"name":"Kyoto University","place":["Kyoto, Japan"]}]},{"given":"Kosei","family":"Sakamoto","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/033y26782","id-type":"ROR","asserted-by":"publisher"}],"name":"Mitsubishi Electric Corporation","place":["Kamakura, Japan"]},{"id":[{"id":"https:\/\/ror.org\/035t8zc32","id-type":"ROR","asserted-by":"publisher"}],"name":"The University of Osaka","place":["1-5 Yamadaoka, Suita, Osaka, 565-0871, Japan"]}]},{"given":"Atsushi","family":"Tanaka","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/035t8zc32","id-type":"ROR","asserted-by":"publisher"}],"name":"The University of Osaka","place":["1-5 Yamadaoka, Suita, Osaka, 565-0871, Japan"]}]},{"given":"Shion","family":"Utsumi","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/0151bmh98","id-type":"ROR","asserted-by":"publisher"}],"name":"University of Hyogo","place":["Kobe, Japan"]}]},{"given":"Takanori","family":"Isobe","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/035t8zc32","id-type":"ROR","asserted-by":"publisher"}],"name":"The University of Osaka","place":["1-5 Yamadaoka, Suita, Osaka, 565-0871, Japan"]}]}],"member":"48349","published-online":{"date-parts":[[2025,10,6]]},"reference":[{"key":"ref1:DBLP:conf\/sacrypt\/WuP13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-662-43414-7_10","article-title":"AEGIS: A Fast Authenticated Encryption Algorithm","volume":"8282","author":"Hongjun Wu","year":"2013"},{"key":"ref2:DBLP:journals\/tosc\/SakamotoLNKI21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.46586\/tosc.v2021.i2.1-30","article-title":"Rocca: An Efficient AES-based Encryption Scheme for Beyond\n  5G","volume":"2021","author":"Kosei Sakamoto","year":"2021","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref3:DBLP:journals\/iacr\/SakamotoLNKI22","first-page":"116","article-title":"Rocca: An Efficient AES-based Encryption Scheme for Beyond\n  5G (Full version)","author":"Kosei Sakamoto","year":"2022","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref4:nikolic2014tiaoxin","article-title":"Tiaoxin-346","author":"Ivica N","year":"2016","journal-title":"CAESAR competition"},{"key":"ref5:DBLP:conf\/ctrsa\/BossertLLS22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/978-3-030-95312-6_21","article-title":"Pholkos - Efficient Large-State Tweakable Block Ciphers\n  from the AES Round Function","volume":"13161","author":"Jannis Bossert","year":"2022"},{"key":"ref6:DBLP:conf\/acisp\/NakahashiSARSL023","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-031-35486-1_18","article-title":"Ghidle: Efficient Large-State Block Ciphers for\n  Post-quantum Security","volume":"13915","author":"Motoki Nakahashi","year":"2023"},{"key":"ref7:DBLP:conf\/asiacrypt\/GueronM16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-662-53887-6_4","article-title":"Simpira v2: A Family of Efficient Permutations Using the\n  AES Round Function","volume":"10031","author":"Shay Gueron","year":"2016"},{"key":"ref8:DBLP:journals\/tosc\/KolblLMR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.13154\/TOSC.V2016.I2.1-29","article-title":"Haraka v2 - Efficient Short-Input Hashing for Post-Quantum\n  Applications","volume":"2016","author":"Stefan K\u00f6lbl","year":"2016","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref9:DBLP:journals\/tches\/IsobeILMNSS23","doi-asserted-by":"publisher","first-page":"115","DOI":"10.46586\/TCHES.V2023.I2.115-154","article-title":"Areion: Highly-Efficient Permutations and Its Applications\n  to Hash Functions for Short Input","volume":"2023","author":"Takanori Isobe","year":"2023","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"ref10:intel2010aesni","volume-title":"Advanced Encryption Standard AES New Instructions Set","author":"Shay Gueron","year":"2010"},{"key":"ref11:arm2022cryptography","volume-title":"ARMv8 Cryptography Extensions","author":"ARM Limited","year":"2022"},{"key":"ref12:amdaesni","volume-title":"AMD64 Architecture Programmer\u2019s Manual Volume 4: 128-Bit\n  and 256-Bit Media Instructions","author":"AMD","year":"2021"},{"key":"ref13:intel2024pmc","volume-title":"Intel\u00ae 64 and IA-32 Architectures Software Developer\u2019s\n  Manual","author":"Intel Corporation","year":"2024"},{"key":"ref14:DBLP:conf\/iwsec\/ShirayaSI24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-981-97-7737-2_1","article-title":"Bit-Wise Analysis for Forgery Attacks on AES-Based AEAD\n  Schemes","volume":"14977","author":"Takuro Shiraya","year":"2024"},{"key":"ref15:latency","volume-title":"uops.info","author":"Real-Time","year":"2021"},{"key":"ref16:intel_64_IA-32_manual","volume-title":"Intel\u00ae 64 and IA-32 Architectures Software Developer's\n  Manual: Combined Volumes 1, 2A, 2B, 2C, 2D, 3A, 3B, 3C, 3D, and 4","author":"Intel Corporation","year":"2023"},{"key":"ref17:apple2024cpuoptimization","volume-title":"CPU Optimization Guide for Apple Silicon","author":"Apple Inc.","year":"2024"},{"key":"ref18:man7perf2024","volume-title":"perf_event_open(2) - Linux Manual Page","author":"Michael Kerrisk","year":"2024"},{"key":"ref19:apple_xnu2024","volume-title":"XNU Kernel Source Code","author":"Apple Inc.","year":"2024"},{"key":"ref20:ibireme_gist2024","volume-title":"Gist: Understanding Memory Alignment","author":"ibireme","year":"2024"},{"key":"ref21:fog2024instructiontables","volume-title":"Instruction Tables: Lists of instruction latencies,\n  throughputs and micro-operation breakdowns for Intel, AMD, and VIA CPUs","author":"Agner Fog","year":"2024"},{"key":"ref22:DBLP:conf\/asiacrypt\/FlorezGutierrezGLST24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-981-96-0947-5_10","article-title":"General Practical Cryptanalysis of the Sum of Round-Reduced\n  Block Ciphers and ZIP-AES","volume":"15492","author":"Antonio Fl\u00f3rez-Guti\u00e9rrez","year":"2024"},{"key":"ref23:DBLP:conf\/ctrsa\/TakaISI23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-031-30872-7_11","article-title":"An Efficient Strategy to Construct a Better Differential on\n  Multiple-Branch-Based Designs: Application to Orthros","volume":"13871","author":"Kazuma Taka","year":"2023"},{"key":"ref24:DBLP:journals\/tches\/AnandBCIILMRS24","doi-asserted-by":"publisher","first-page":"545","DOI":"10.46586\/TCHES.V2024.I2.545-587","article-title":"Gleeok: A Family of Low-Latency PRFs and its Applications\n  to Authenticated Encryption","volume":"2024","author":"Ravi Anand","year":"2024","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"ref25:DBLP:journals\/tosc\/Sun0W18","doi-asserted-by":"publisher","first-page":"93","DOI":"10.13154\/tosc.v2018.i3.93-123","article-title":"More Accurate Differential Properties of LED64 and\n  Midori64","volume":"2018","author":"Ling Sun","year":"2018","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref26:DBLP:journals\/tosc\/SunWW21","doi-asserted-by":"publisher","first-page":"269","DOI":"10.46586\/tosc.v2021.i1.269-315","article-title":"Accelerating the Search of Differential and Linear\n  Characteristics with the SAT Method","volume":"2021","author":"Ling Sun","year":"2021","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref27:DBLP:conf\/cans\/TaiyamaSSI24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-981-97-8016-7_12","article-title":"Collision Attacks on Hashing Modes of Areion","volume":"14906","author":"Kodai Taiyama","year":"2024"},{"key":"ref28:DBLP:conf\/crypto\/BeyneR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/978-3-031-15982-4_23","article-title":"Differential Cryptanalysis in the Fixed-Key Model","volume":"13509","author":"Tim Beyne","year":"2022"},{"key":"ref29:DBLP:conf\/crypto\/LiuDMIWC19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-030-26951-7_5","article-title":"Efficient Collision Attack Frameworks for RIPEMD-160","volume":"11693","author":"Fukang Liu","year":"2019"},{"key":"ref30:DBLP:conf\/eurocrypt\/LiuWSAMLI23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-031-30634-1_7","article-title":"Analysis of RIPEMD-160: New Collision Attacks and Finding\n  Characteristics with MILP","volume":"14007","author":"Fukang Liu","year":"2023"},{"key":"ref31:DBLP:conf\/asiacrypt\/HouDQZW23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-981-99-8727-6_13","article-title":"Automated Meet-in-the-Middle Attack Goes to Feistel","volume":"14440","author":"Qingliang Hou","year":"2023"},{"key":"ref32:DBLP:conf\/fse\/Sasaki11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-642-21702-9_22","article-title":"Meet-in-the-Middle Preimage Attacks on AES Hashing Modes\n  and an Application to Whirlpool","volume":"6733","author":"Yu Sasaki","year":"2011"},{"key":"ref33:DBLP:conf\/eurocrypt\/SasakiA09","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-01001-9_8","article-title":"Finding Preimages in Full MD5 Faster Than Exhaustive\n  Search","volume":"5479","author":"Yu Sasaki","year":"2009"},{"key":"ref34:DBLP:conf\/asiacrypt\/AokiGMSW09","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-642-10366-7_34","article-title":"Preimages for Step-Reduced SHA-2","volume":"5912","author":"Kazumaro Aoki","year":"2009"},{"key":"ref35:DBLP:conf\/sacrypt\/AokiS08","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-04159-4_7","article-title":"Preimage Attacks on One-Block MD4, 63-Step MD5 and\n  More","volume":"5381","author":"Kazumaro Aoki","year":"2008"},{"key":"ref36:DBLP:conf\/acns\/Sasaki13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-38980-1_11","article-title":"Preimage Attacks on Feistel-SP Functions: Impact of\n  Omitting the Last Network Twist","volume":"7954","author":"Yu Sasaki","year":"2013"},{"key":"ref37:DBLP:conf\/acisp\/TjuawinataHW17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-319-60055-0_20","article-title":"Cryptanalysis of Simpira v2","volume":"10342","author":"Ivan Tjuawinata","year":"2017"},{"key":"ref38:DBLP:journals\/chinaf\/ZongDW18","doi-asserted-by":"publisher","DOI":"10.1007\/S11432-016-9075-6","article-title":"Impossible differential attack on Simpira v2","volume":"61","author":"Rui Zong","year":"2018","journal-title":"Sci. China Inf. Sci."},{"key":"ref39:DBLP:journals\/tosc\/DerbezFIRS24","doi-asserted-by":"publisher","first-page":"135","DOI":"10.46586\/TOSC.V2024.I1.135-157","article-title":"Key Committing Attacks against AES-based AEAD Schemes","volume":"2024","author":"Patrick Derbez","year":"2024","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref40:DBLP:conf\/eurocrypt\/BellareH22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1007\/978-3-031-07085-3_29","article-title":"Efficient Schemes for Committing Authenticated\n  Encryption","volume":"13276","author":"Mihir Bellare","year":"2022"},{"key":"ref41:DBLP:conf\/crypto\/GrubbsLR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-319-63697-9_3","article-title":"Message Franking via Committing Authenticated Encryption","volume":"10403","author":"Paul Grubbs","year":"2017"},{"key":"ref42:DBLP:conf\/crypto\/DodisGRW18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-319-96884-1_6","article-title":"Fast Message Franking: From Invisible Salamanders to\n  Encryptment","volume":"10991","author":"Yevgeniy Dodis","year":"2018"},{"key":"ref43:DBLP:conf\/esorics\/ChanR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-031-17146-8_14","article-title":"On Committing Authenticated-Encryption","volume":"13555","author":"John Chan","year":"2022"},{"key":"ref44:DBLP:conf\/uss\/AlbertiniDGKLS22","first-page":"3291","article-title":"How to Abuse and Fix Authenticated Encryption Without Key\n  Commitment","author":"Ange Albertini","year":"2022"},{"key":"ref45:DBLP:journals\/iet-ifs\/ShirayaTSI23","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1049\/ISE2.12109","article-title":"MILP-based security evaluation for\n  AEGIS\/Tiaoxin-346\/Rocca","volume":"17","author":"Takuro Shiraya","year":"2023","journal-title":"IET Inf. Secur."},{"key":"ref46:DBLP:conf\/sacrypt\/Minaud14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-319-13051-4_18","article-title":"Linear Biases in AEGIS Keystream","volume":"8781","author":"Brice Minaud","year":"2014"},{"key":"ref47:DBLP:journals\/tosc\/EichlsederNP19","doi-asserted-by":"publisher","first-page":"348","DOI":"10.13154\/TOSC.V2019.I4.348-368","article-title":"Analyzing the Linear Keystream Biases in AEGIS","volume":"2019","author":"Maria Eichlseder","year":"2019","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref48:irtf-cfrg-aegis-aead-12","volume-title":"The AEGIS Family of Authenticated Encryption Algorithms","author":"Frank Denis","year":"2024"},{"key":"ref49:sac15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-319-31301-6_10","article-title":"Exploring Energy Efficiency of Lightweight Block Ciphers","volume":"9566","author":"Subhadeep Banik","year":"2015"},{"key":"ref50:bk","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/TC.1982.1675982","article-title":"A Regular Layout for Parallel Adders","author":"Richard P. Brent","year":"1982","journal-title":"IEEE Trans. Computers"},{"key":"ref51:ks","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1109\/TC.1973.5009159","article-title":"A Parallel Algorithm for the Efficient Solution of a General\n  Class of Recurrence Equations","volume":"22","author":"Peter M. Kogge","year":"1973","journal-title":"IEEE Trans. Computers"},{"key":"ref52:lf","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel Prefix Computation","volume":"27","author":"Richard E. Ladner","year":"1980","journal-title":"J. ACM","ISSN":"https:\/\/id.crossref.org\/issn\/0004-5411","issn-type":"electronic"},{"key":"ref53:space","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-031-80408-3_3","article-title":"Faster and More Energy-Efficient Equation Solvers over\n  GF(2)","volume":"15351","author":"Subhadeep Banik","year":"2024"},{"key":"ref54:DBLP:conf\/ches\/KerckhofDHBS12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-642-33027-8_23","article-title":"Towards Green Cryptography: A Comparison of Lightweight\n  Ciphers from the Energy Viewpoint","volume":"7428","author":"St\u00e9phanie Kerckhof","year":"2012"},{"key":"ref55:hutter","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/2996366.2996373","article-title":"Threshold Implementations in Industry: A Case Study on\n  SHA-256","author":"Michael Hutter","year":"2016"},{"key":"ref56:goubin","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-44709-1_2","article-title":"A Sound Method for Switching between Boolean and Arithmetic\n  Masking","volume":"2162","author":"Louis Goubin","year":"2001"},{"key":"ref57:hutter1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.62056\/A3C0L2ISFG","article-title":"Efficient Boolean-to-Arithmetic Mask Conversion in\n  Hardware","volume":"1","author":"Aein Rezaei Shahmirzadi","year":"2024","journal-title":"IACR Commun. Cryptol."},{"key":"ref58:coron","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-662-48116-5_7","article-title":"Conversion from Arithmetic to Boolean Masking with\n  Logarithmic Complexity","volume":"9054","author":"Jean-S\u00e9bastien Coron","year":"2015"}],"container-title":["IACR Communications in Cryptology"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T20:23:19Z","timestamp":1759782199000},"score":1,"resource":{"primary":{"URL":"https:\/\/cic.iacr.org\/p\/2\/3\/28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,6]]},"references-count":58,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,10,6]]}},"URL":"https:\/\/doi.org\/10.62056\/anxrudy6b","archive":["Internet Archive","Internet Archive"],"relation":{},"ISSN":["3006-5496"],"issn-type":[{"value":"3006-5496","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,6]]},"assertion":[{"value":"2025-07-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-09-02","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"cc2-3-51"}}