Advanced Spatiotemporal Chaos-Based Hash Functions for Enhanced Security

Advanced Spatiotemporal Chaos-Based Hash Functions for Enhanced Security | 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 Advanced Spatiotemporal Chaos-Based Hash Functions for Enhanced Security Yuxuan Li This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4053323/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 The domain of nonlinear science has witnessed a burgeoning interest in the study of spatiotemporal chaos, prompting a deeper investigation into its complex dynamics. This research introduces an innovative enhancement to the cross-coupled map lattice, presenting a novel spatiotemporal chaotic map that signifies a leap forward in chaotic systems' modeling. Our comprehensive experimental analysis demonstrates that this updated cross-coupled map lattice significantly surpasses its predecessor in terms of chaotic behavior and performance. Considering the escalating relevance of hash functions across various sectors—most notably in cryptography, data integrity verification, and data indexing—our work leverages this pioneering spatiotemporal chaos framework to forge new paths in hash function development. We have engineered a state-of-the-art hash function that harnesses the sophisticated dynamics of the enhanced cross-coupled map lattice. This function adeptly processes variable-length input data, producing fixed-size hash outputs of 128, 256, or 512 bits. Through a series of rigorous tests designed to simulate a range of potential cryptographic attacks, we have validated the exceptional security and resilience of our hash function. Our thorough experimental scrutiny reveals the hash function's robust security features, confirming its suitability for critical applications that demand high levels of data integrity and enhanced cryptographic protection. This exploration into spatiotemporal chaos not only sets a new benchmark for hash function design but also contributes significantly to the broader field of cryptography, offering robust solutions to the contemporary challenges faced in digital security. Theoretical Computer Science Spatiotemporal chaos Cross-coupled map lattice Hash function Full Text Additional Declarations The authors declare no competing interests. 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-4053323","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":277625231,"identity":"8431dc9e-2780-4d84-8269-fea9d7bb4a8b","order_by":0,"name":"Yuxuan Li","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAxUlEQVRIiWNgGAWjYBACPmYQWSHBw8be2PjwAzFa2MBaztjI8fEcbjaWIEoLiGBsSzOWk0hvE+AhSgs7j5k0D9vhxDbJh20MEgx2croNBB3GYyY5gweoRTqx7UEBQ7Kx2QEitEh8kABraTeQYDiQuI0oLQkGIIcdbJPgIVrLh4Q0YzYJRqK1sBVbzjhgI8fGkwgMZAMi/MLPf3jjbd5/Ejzy7ccfPvxQYSdHUAsDA4cBEscApzJkwP6AKGWjYBSMglEwggEAMIY3vYsl4EYAAAAASUVORK5CYII=","orcid":"https://orcid.org/0000-0002-5145-8607","institution":"University of Jinan","correspondingAuthor":true,"submittingAuthor":false,"prefix":"","firstName":"Yuxuan","middleName":"","lastName":"Li","suffix":""}],"badges":[],"createdAt":"2024-03-09 08:01:52","currentVersionCode":1,"declarations":{"humanSubjects":false,"vertebrateSubjects":false,"conflictsOfInterestStatement":false,"humanSubjectEthicalGuidelines":false,"humanSubjectConsent":false,"humanSubjectClinicalTrial":false,"humanSubjectCaseReport":false,"vertebrateSubjectEthicalGuidelines":false,"coiExplicitlySet":false},"doi":"10.21203/rs.3.rs-4053323/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4053323/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":52391555,"identity":"273d5043-be18-4bce-a434-90c8f0da43cd","added_by":"auto","created_at":"2024-03-11 03:27:32","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":918774,"visible":true,"origin":"","legend":"","description":"","filename":"4.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4053323/v1_covered_9e7d2125-ef10-4b37-b1d4-b9e3d9cf9e7e.pdf"}],"financialInterests":"The authors declare no competing interests.","formattedTitle":"\u003cp\u003eAdvanced Spatiotemporal Chaos-Based Hash Functions for Enhanced Security\u003c/p\u003e","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"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":"Spatiotemporal chaos, Cross-coupled map lattice, Hash function","lastPublishedDoi":"10.21203/rs.3.rs-4053323/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4053323/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eThe domain of nonlinear science has witnessed a burgeoning interest in the study of spatiotemporal chaos, prompting a deeper investigation into its complex dynamics. This research introduces an innovative enhancement to the cross-coupled map lattice, presenting a novel spatiotemporal chaotic map that signifies a leap forward in chaotic systems' modeling. Our comprehensive experimental analysis demonstrates that this updated cross-coupled map lattice significantly surpasses its predecessor in terms of chaotic behavior and performance. Considering the escalating relevance of hash functions across various sectors—most notably in cryptography, data integrity verification, and data indexing—our work leverages this pioneering spatiotemporal chaos framework to forge new paths in hash function development. We have engineered a state-of-the-art hash function that harnesses the sophisticated dynamics of the enhanced cross-coupled map lattice. This function adeptly processes variable-length input data, producing fixed-size hash outputs of 128, 256, or 512 bits. Through a series of rigorous tests designed to simulate a range of potential cryptographic attacks, we have validated the exceptional security and resilience of our hash function. Our thorough experimental scrutiny reveals the hash function's robust security features, confirming its suitability for critical applications that demand high levels of data integrity and enhanced cryptographic protection. This exploration into spatiotemporal chaos not only sets a new benchmark for hash function design but also contributes significantly to the broader field of cryptography, offering robust solutions to the contemporary challenges faced in digital security.\u003c/p\u003e","manuscriptTitle":"Advanced Spatiotemporal Chaos-Based Hash Functions for Enhanced Security","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-03-11 03:19:21","doi":"10.21203/rs.3.rs-4053323/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":"0068430d-4ab5-4e64-8bac-d8e0862d992e","owner":[],"postedDate":"March 11th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[{"id":29255165,"name":"Theoretical Computer Science"}],"tags":[],"updatedAt":"2024-03-11T03:19:21+00:00","versionOfRecord":[],"versionCreatedAt":"2024-03-11 03:19:21","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4053323","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4053323","identity":"rs-4053323","version":["v1"]},"buildId":"ehx78VzkSd0WSzXnipQa-","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}