Design and Analysis of a Cryptographic Hash Function Incorporating Parallel Confusion and a Multi-Compression Architecture | 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 Design and Analysis of a Cryptographic Hash Function Incorporating Parallel Confusion and a Multi-Compression Architecture Yijun Yang, Linlin Wang, Meileng Yuan, Bin Li, Zhuolin Zhong, and 1 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4884979/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 cryptographic hash function stands as a cornerstone among the trio of essential cryptographic algorithms that are ubiquitously utilized across blockchain technology, digital signature applications, cloud storage solutions, and numerous other domains. Currently, a series of MD4-inspired hash functions, including RIPEMD, RIPEMD128, MD5, and SHA-1, have been critically evaluated and deemed insufficient in terms of security[ 10 – 13 ], thereby emphasizing the paramount importance of heightened vigilance towards safeguarding the integrity of cryptographic hash functions. Notably, the preponderance of prevalent hash functions relies heavily on inefficient serial architectures, posing limitations in terms of performance and scalability. To address these shortcomings, this paper introduces a groundbreaking cryptographic hash function, predicated on a parallel confusion and multi-compression structure (PCMCH). This innovative methodology innovatively fills the input data through a parallel confusion compression mechanism, concurrently executing multi-faceted confusion compression on each message block. Furthermore, it expedites message diffusion by meticulously tuning adaptable permutation parameters, enhancing both the speed and efficacy of the process. The exhaustive experimental analysis conducted underscores the exceptional security characteristics of the proposed hash function, including irregularity, the avalanche effect, high information entropy, and robust collision resistance. Moreover, its performance surpasses that of existing parallel hash functions, marking it as a promising contender that offers superior efficiency and security, thereby presenting a viable alternative for applications requiring heightened cryptographic safeguards. cryptographic hash function parallel confusion multi-compression collision-resistance 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-4884979","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":338366321,"identity":"3bf3449c-e6a3-476b-8e8a-e90c40e0d191","order_by":0,"name":"Yijun Yang","email":"","orcid":"","institution":"Guangdong Hong Kong Macao Greater Bay Area Artificial Intelligence Research Institute, Shenzhen Polytechnic University","correspondingAuthor":false,"prefix":"","firstName":"Yijun","middleName":"","lastName":"Yang","suffix":""},{"id":338366322,"identity":"3c740b61-e33a-4b24-8f77-14eb33840940","order_by":1,"name":"Linlin Wang","email":"","orcid":"","institution":"Shenzhen Polytechnic University","correspondingAuthor":false,"prefix":"","firstName":"Linlin","middleName":"","lastName":"Wang","suffix":""},{"id":338366323,"identity":"b8a6e832-516f-49bc-983d-9a871379006d","order_by":2,"name":"Meileng Yuan","email":"","orcid":"","institution":"Shenzhen Polytechnic University","correspondingAuthor":false,"prefix":"","firstName":"Meileng","middleName":"","lastName":"Yuan","suffix":""},{"id":338366324,"identity":"de965272-038f-4f88-9f36-82829c290096","order_by":3,"name":"Bin Li","email":"","orcid":"","institution":"Shenzhen Polytechnic University","correspondingAuthor":false,"prefix":"","firstName":"Bin","middleName":"","lastName":"Li","suffix":""},{"id":338366325,"identity":"24eb71e0-9ecc-40cc-b960-a99ee1618b68","order_by":4,"name":"Zhuolin Zhong","email":"","orcid":"","institution":"Shenzhen Polytechnic University","correspondingAuthor":false,"prefix":"","firstName":"Zhuolin","middleName":"","lastName":"Zhong","suffix":""},{"id":338366326,"identity":"5057bfa5-9cbc-4273-94ef-348f78eee7fc","order_by":5,"name":"Xiaohu Yan","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA50lEQVRIiWNgGAWjYLCCBDACgQoJOXkStZyxMDZsIN4iIGBsq0hkOEBAqcHxs8ckHtTY5BmcP/7sMe88iQTGBuaHj27g03ImL9kg4VhascGNhHRj3m0SeewMbMbGOfi0HMgxfJDAdjhxww2GY9JALcWMDTxs0ni1nH9jcCDhH1DL+YNt0rxzJBIbDhDScgNoS2IbUMuBZDZp3gYitEjeeGNskNiXljjzRhq74ZxjEsaGzQT8wnc+x0zyxzebxD5giD14U1MnJ8/e/PAxPi0KBxBsNgjFjEc5CMg3YGgZBaNgFIyCUYAGAD6IUG+2owHaAAAAAElFTkSuQmCC","orcid":"","institution":"Shenzhen Polytechnic University","correspondingAuthor":true,"prefix":"","firstName":"Xiaohu","middleName":"","lastName":"Yan","suffix":""}],"badges":[],"createdAt":"2024-08-09 07:01:43","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4884979/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4884979/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":64528987,"identity":"d30c5994-3fb7-4e71-a6fa-60e53058709e","added_by":"auto","created_at":"2024-09-14 14:58:54","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":649507,"visible":true,"origin":"","legend":"","description":"","filename":"newmanuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4884979/v1_covered_f1975895-8160-4359-9258-9284a13a6318.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Design and Analysis of a Cryptographic Hash Function Incorporating Parallel Confusion and a Multi-Compression Architecture","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":"cryptographic hash function, parallel confusion, multi-compression, collision-resistance","lastPublishedDoi":"10.21203/rs.3.rs-4884979/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4884979/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eThe cryptographic hash function stands as a cornerstone among the trio of essential cryptographic algorithms that are ubiquitously utilized across blockchain technology, digital signature applications, cloud storage solutions, and numerous other domains. Currently, a series of MD4-inspired hash functions, including RIPEMD, RIPEMD128, MD5, and SHA-1, have been critically evaluated and deemed insufficient in terms of security[\u003cspan additionalcitationids=\"CR11 CR12\" citationid=\"CR10\" class=\"CitationRef\"\u003e10\u003c/span\u003e\u0026ndash;\u003cspan citationid=\"CR13\" class=\"CitationRef\"\u003e13\u003c/span\u003e], thereby emphasizing the paramount importance of heightened vigilance towards safeguarding the integrity of cryptographic hash functions. Notably, the preponderance of prevalent hash functions relies heavily on inefficient serial architectures, posing limitations in terms of performance and scalability. To address these shortcomings, this paper introduces a groundbreaking cryptographic hash function, predicated on a parallel confusion and multi-compression structure (PCMCH). This innovative methodology innovatively fills the input data through a parallel confusion compression mechanism, concurrently executing multi-faceted confusion compression on each message block. Furthermore, it expedites message diffusion by meticulously tuning adaptable permutation parameters, enhancing both the speed and efficacy of the process. The exhaustive experimental analysis conducted underscores the exceptional security characteristics of the proposed hash function, including irregularity, the avalanche effect, high information entropy, and robust collision resistance. Moreover, its performance surpasses that of existing parallel hash functions, marking it as a promising contender that offers superior efficiency and security, thereby presenting a viable alternative for applications requiring heightened cryptographic safeguards.\u003c/p\u003e","manuscriptTitle":"Design and Analysis of a Cryptographic Hash Function Incorporating Parallel Confusion and a Multi-Compression Architecture","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-09-05 04:26:18","doi":"10.21203/rs.3.rs-4884979/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":"c2a51f14-1598-4a83-ba9b-0b1968804d9e","owner":[],"postedDate":"September 5th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2024-09-14T14:50:45+00:00","versionOfRecord":[],"versionCreatedAt":"2024-09-05 04:26:18","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4884979","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4884979","identity":"rs-4884979","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","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.