A method for constructing post-quantum EDS algorithms with small signature and public key sizes based on finite noncommutative associative algebras with two hidden groups

preprint OA: closed
Full text JSON View at publisher
AI-generated deep summary by claude@2026-06, 2026-06-24 · read from full text

This paper proposes a methodology for constructing post-quantum digital signature (EDS) algorithms using finite noncommutative associative algebras, combining “two hidden noncommutative groups” with chaotic mappings to enhance signature randomization while aiming for compact signature and public key sizes. The authors use evolutionary algorithms to automatically design algebraic multiplication tables that satisfy associativity and optimize performance, and they generate one-time exponent parameters using logistic mappings to introduce chaos and resist statistical cryptanalysis, including in bulk signature analysis. Experimental evaluation reports exponential complexity growth for attack models under optimized parameters and demonstrates efficient implementation in Python/NumPy. This paper does not explicitly discuss limitations in the provided text beyond being a Research Square preprint that has not been peer reviewed, and the security claims are presented via modeled attack complexity rather than standardized benchmarks. The paper does not explicitly discuss endometriosis or adenomyosis; it was included in the corpus via a keyword match in the upstream search index.

Read from the paper's body, not the abstract. Not a substitute for reading the paper. No clinical advice. How this works

Abstract

Abstract This paper presents a novel methodology for constructing post-quantum digital signature algorithms based on finite noncommutative associative algebras. The proposed approach enhances signature randomization by leveraging the algebraic interaction of two hidden noncommutative groups and chaotic mappings, resulting in both compact key representations and increased cryptographic robustness. A core contribution is the implementation of evolutionary algorithms for the automated design of multiplication tables, ensuring associativity and optimized performance. One-time exponent parameters b and n are generated using logistic mappings to introduce chaos, thereby impeding statistical cryptanalysis even in scenarios involving bulk signature analysis. Experimental evaluation confirms the exponential complexity of attack models under optimized parameters, while also validating efficient real-world implementation using Python and NumPy. This work is the first to systematically apply evolutionary search to the generation of algebraic structures for digital signatures, demonstrating practical post-quantum security and computational feasibility.
Full text 20,156 characters · extracted from preprint-html · click to expand
A method for constructing post-quantum EDS algorithms with small signature and public key sizes based on finite noncommutative associative algebras with two hidden groups | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article A method for constructing post-quantum EDS algorithms with small signature and public key sizes based on finite noncommutative associative algebras with two hidden groups Alexey Petrenko, Natalie Grigorieva This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7943157/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract This paper presents a novel methodology for constructing post-quantum digital signature algorithms based on finite noncommutative associative algebras. The proposed approach enhances signature randomization by leveraging the algebraic interaction of two hidden noncommutative groups and chaotic mappings, resulting in both compact key representations and increased cryptographic robustness. A core contribution is the implementation of evolutionary algorithms for the automated design of multiplication tables, ensuring associativity and optimized performance. One-time exponent parameters b and n are generated using logistic mappings to introduce chaos, thereby impeding statistical cryptanalysis even in scenarios involving bulk signature analysis. Experimental evaluation confirms the exponential complexity of attack models under optimized parameters, while also validating efficient real-world implementation using Python and NumPy. This work is the first to systematically apply evolutionary search to the generation of algebraic structures for digital signatures, demonstrating practical post-quantum security and computational feasibility. post-quantum cryptography noncommutative associative algebras double randomization of signature chaotic maps evolutionary algorithms hidden commutative groups quantum stability digital signature algebraic structure key generation Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-7943157","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":546782484,"identity":"d1fdb90c-021f-4731-b0b2-fa999580a40d","order_by":0,"name":"Alexey Petrenko","email":"","orcid":"","institution":"Sirius University of Science and Technology","correspondingAuthor":false,"prefix":"","firstName":"Alexey","middleName":"","lastName":"Petrenko","suffix":""},{"id":546782485,"identity":"00da05e7-5b42-469a-b031-176b6bacf0f7","order_by":1,"name":"Natalie Grigorieva","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABH0lEQVRIie3Nv0vDQBTA8XccpMuLrh3k8i9cCMQWav8Rl4RAJv8DhwYKNwW6BsT/oeDq8Moh2ZwjZgsEB4e4dQhoU4o/MK2Ogvcd7o67+/AATKY/GUs+zg3ASbdTt8jfEJYFgAD8J/IpjjsCh4hzrudPL7eTcJHYdzdn6ykeXy1WGttSnIJdD3uIex+qcVbHYUZH8eNFEOGw1KBtVXvjZOD3kpQpD0l7QOhvCEcoog1JdLgkyzpAXj2nI6Nghk5HsNWzfcRBNq+QSMiOQKBRbomlA7mHSGSKZRQJV6P/kMY5ukUkV9eqdpfa4qO+KemgahqaoshTv1hPLoUowqp5bktH5ooVfVMIdtP51wf6dvM+JQHe9D1Q/3+TyWT6j70BCFRm5ziEIiAAAAAASUVORK5CYII=","orcid":"","institution":"Sirius University of Science and Technology","correspondingAuthor":true,"prefix":"","firstName":"Natalie","middleName":"","lastName":"Grigorieva","suffix":""}],"badges":[],"createdAt":"2025-10-26 09:27:44","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-7943157/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7943157/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":96348195,"identity":"645e9475-cb80-4b7e-82c0-85fbdde15f59","added_by":"auto","created_at":"2025-11-20 06:39:53","extension":"docx","order_by":0,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":361295,"visible":true,"origin":"","legend":"","description":"","filename":"AmethodforconstructingpostquantumEDSalgorithmswithsmallsignatureandpublickeysizesbasedonfinitenoncommutativeassociativealgebraswith.docx","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/37a8927db4f01d2f2da14083.docx"},{"id":96348192,"identity":"dba7f460-b63f-4a9d-85c5-b7571d8b1de4","added_by":"auto","created_at":"2025-11-20 06:39:53","extension":"json","order_by":1,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":4430,"visible":true,"origin":"","legend":"","description":"","filename":"6bd87148b3104c2bbe1542894024c68f.json","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/e21e9debf3af9cab65291d56.json"},{"id":96348198,"identity":"5d69084e-7d64-413f-a901-be4f4020f47e","added_by":"auto","created_at":"2025-11-20 06:39:53","extension":"xml","order_by":2,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":123141,"visible":true,"origin":"","legend":"","description":"","filename":"6bd87148b3104c2bbe1542894024c68f1enriched.xml","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/4851231d63351d974d06f052.xml"},{"id":96348188,"identity":"35162c6c-942e-48c0-a83d-a8fc98184461","added_by":"auto","created_at":"2025-11-20 06:39:53","extension":"png","order_by":3,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":11933,"visible":true,"origin":"","legend":"","description":"","filename":"floatimage1.png","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/ba5b256dcca31eebceaec735.png"},{"id":96348187,"identity":"9c5acf64-87c4-44dd-88d9-5806bd8543e5","added_by":"auto","created_at":"2025-11-20 06:39:53","extension":"png","order_by":4,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":9961,"visible":true,"origin":"","legend":"","description":"","filename":"floatimage2.png","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/a87ec7b5434f1694ba40201a.png"},{"id":96348189,"identity":"a1e6ad7b-0105-4283-ade3-5b5adeafa8b3","added_by":"auto","created_at":"2025-11-20 06:39:53","extension":"png","order_by":5,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":4040,"visible":true,"origin":"","legend":"","description":"","filename":"floatimage3.png","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/cb26a6e5d6ed276fe93a0967.png"},{"id":96367522,"identity":"9365ca63-e057-4aad-a519-cd5bd5661192","added_by":"auto","created_at":"2025-11-20 10:13:03","extension":"png","order_by":6,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":17901,"visible":true,"origin":"","legend":"","description":"","filename":"floatimage4.png","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/7022b0525b107f38a04f9975.png"},{"id":96366454,"identity":"66d8b9c6-73f5-4835-9535-9d2db1ee5864","added_by":"auto","created_at":"2025-11-20 10:11:28","extension":"png","order_by":7,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":19223,"visible":true,"origin":"","legend":"","description":"","filename":"floatimage5.png","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/e62852630cfcd1c26cacee3d.png"},{"id":96366806,"identity":"62d65cca-2635-4df0-bd28-ff4c8617089f","added_by":"auto","created_at":"2025-11-20 10:11:55","extension":"png","order_by":8,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":69851,"visible":true,"origin":"","legend":"","description":"","filename":"floatimage6.png","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/977a186a96de75e9f0f766c5.png"},{"id":96366325,"identity":"0c9a005f-a086-4a3b-853f-4314e0096176","added_by":"auto","created_at":"2025-11-20 10:11:22","extension":"png","order_by":9,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":34007,"visible":true,"origin":"","legend":"","description":"","filename":"floatimage7.png","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/7a78b93d8cb52b2a6bfa2d6a.png"},{"id":96366881,"identity":"8137c68e-ffde-4e8d-ba71-f8c0ee822687","added_by":"auto","created_at":"2025-11-20 10:12:00","extension":"png","order_by":10,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":59822,"visible":true,"origin":"","legend":"","description":"","filename":"floatimage8.png","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/ea884a97b63fb109d907f982.png"},{"id":96366812,"identity":"b19cd648-d558-4312-91d6-be9a10842e20","added_by":"auto","created_at":"2025-11-20 10:11:55","extension":"png","order_by":11,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":63663,"visible":true,"origin":"","legend":"","description":"","filename":"floatimage9.png","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/e9b673cab213782c1add7e38.png"},{"id":96367431,"identity":"fcac1179-3164-4c40-9d36-3e66fae7bbc0","added_by":"auto","created_at":"2025-11-20 10:12:45","extension":"png","order_by":12,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":4483,"visible":true,"origin":"","legend":"","description":"","filename":"Onlinefloatimage1.png","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/bc8b27532f1181f0684a7841.png"},{"id":96348201,"identity":"ef3afe12-2695-4f1e-9dce-74e16a53c535","added_by":"auto","created_at":"2025-11-20 06:39:53","extension":"png","order_by":13,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":4149,"visible":true,"origin":"","legend":"","description":"","filename":"Onlinefloatimage2.png","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/7ad840112cce2066f396b26e.png"},{"id":96367130,"identity":"1d0001b0-dcd8-4cc3-b7d1-6c121846f86d","added_by":"auto","created_at":"2025-11-20 10:12:12","extension":"png","order_by":14,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":1915,"visible":true,"origin":"","legend":"","description":"","filename":"Onlinefloatimage3.png","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/b97061d35f327e9dc62dec85.png"},{"id":96367210,"identity":"ab1125cb-de6c-4096-aac6-6b50191fa126","added_by":"auto","created_at":"2025-11-20 10:12:17","extension":"png","order_by":15,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":6145,"visible":true,"origin":"","legend":"","description":"","filename":"Onlinefloatimage4.png","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/bf0333630ea81c2ae4cd9f18.png"},{"id":96348206,"identity":"21b0d8e6-134d-44f5-9c9b-47110ce7556e","added_by":"auto","created_at":"2025-11-20 06:39:53","extension":"png","order_by":16,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":6707,"visible":true,"origin":"","legend":"","description":"","filename":"Onlinefloatimage5.png","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/1ca51eefc6e5d6f289218787.png"},{"id":96348207,"identity":"6be99b20-7d71-4100-ba3a-fbbdd349ae5d","added_by":"auto","created_at":"2025-11-20 06:39:53","extension":"png","order_by":17,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":21166,"visible":true,"origin":"","legend":"","description":"","filename":"Onlinefloatimage6.png","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/f268437fd61f9a5c167d6a2a.png"},{"id":96366433,"identity":"b3686c3b-e188-46e3-9912-de4d642376fe","added_by":"auto","created_at":"2025-11-20 10:11:27","extension":"png","order_by":18,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":9115,"visible":true,"origin":"","legend":"","description":"","filename":"Onlinefloatimage7.png","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/e7e47096106829faec6cef54.png"},{"id":96348199,"identity":"37d1d589-9fd6-4a41-a745-42359579eb7f","added_by":"auto","created_at":"2025-11-20 06:39:53","extension":"png","order_by":19,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":18634,"visible":true,"origin":"","legend":"","description":"","filename":"Onlinefloatimage8.png","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/449fd97fc2db4e7ba4bc7615.png"},{"id":96366669,"identity":"c1544945-d793-4f90-afef-d7ee48d5b895","added_by":"auto","created_at":"2025-11-20 10:11:43","extension":"png","order_by":20,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":19430,"visible":true,"origin":"","legend":"","description":"","filename":"Onlinefloatimage9.png","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/377c9bba778877f61e8a1776.png"},{"id":96348208,"identity":"d8943440-7dbe-4893-b491-ac34ec2691c8","added_by":"auto","created_at":"2025-11-20 06:39:54","extension":"xml","order_by":21,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":121436,"visible":true,"origin":"","legend":"","description":"","filename":"6bd87148b3104c2bbe1542894024c68f1structuring.xml","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/e4e7a83376718cba0b5a84ed.xml"},{"id":96367212,"identity":"442e4d5a-d25a-4207-9aae-5f7ea1c743a2","added_by":"auto","created_at":"2025-11-20 10:12:17","extension":"html","order_by":22,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":155615,"visible":true,"origin":"","legend":"","description":"","filename":"earlyproof.html","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1/730311b8d9f762600c4dcd32.html"},{"id":98947490,"identity":"2ad7534a-c98a-42bd-9f22-3114ee85a8c6","added_by":"auto","created_at":"2025-12-24 12:40:14","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":650998,"visible":true,"origin":"","legend":"","description":"","filename":"AmethodforconstructingpostquantumEDSalgorithmswithsmallsignatureandpublickeysizesbasedonfinitenoncommutativeassociativealgebraswith.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7943157/v1_covered_5d7b6d0e-5a1a-498a-8f79-16bf51bce1a0.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"A method for constructing post-quantum EDS algorithms with small signature and public key sizes based on finite noncommutative associative algebras with two hidden groups","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"post-quantum cryptography, noncommutative associative algebras, double randomization of signature, chaotic maps, evolutionary algorithms, hidden commutative groups, quantum stability, digital signature, algebraic structure, key generation","lastPublishedDoi":"10.21203/rs.3.rs-7943157/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7943157/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eThis paper presents a novel methodology for constructing post-quantum digital signature algorithms based on finite noncommutative associative algebras. The proposed approach enhances signature randomization by leveraging the algebraic interaction of two hidden noncommutative groups and chaotic mappings, resulting in both compact key representations and increased cryptographic robustness. A core contribution is the implementation of evolutionary algorithms for the automated design of multiplication tables, ensuring associativity and optimized performance. One-time exponent parameters b and n are generated using logistic mappings to introduce chaos, thereby impeding statistical cryptanalysis even in scenarios involving bulk signature analysis. Experimental evaluation confirms the exponential complexity of attack models under optimized parameters, while also validating efficient real-world implementation using Python and NumPy. This work is the first to systematically apply evolutionary search to the generation of algebraic structures for digital signatures, demonstrating practical post-quantum security and computational feasibility.\u003c/p\u003e","manuscriptTitle":"A method for constructing post-quantum EDS algorithms with small signature and public key sizes based on finite noncommutative associative algebras with two hidden groups","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-11-20 06:39:49","doi":"10.21203/rs.3.rs-7943157/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"b31af42e-f16f-4a10-bb16-dc10219bf02e","owner":[],"postedDate":"November 20th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2025-12-24T12:39:15+00:00","versionOfRecord":[],"versionCreatedAt":"2025-11-20 06:39:49","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-7943157","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7943157","identity":"rs-7943157","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00