Efficient Post-Quantum Digital Signature Schemes Using QC-MDPC

Efficient Post-Quantum Digital Signature Schemes Using QC-MDPC | 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 Efficient Post-Quantum Digital Signature Schemes Using QC-MDPC Yongfeng Niu, Yuanyuan Lian, Yizhuo Zhang, Huiling Yu This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-5988828/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 With the development of quantum computers and quantum attack algorithms, it is crucial to design digital signature algorithms that are resistant to quantum attacks. CFS scheme is one of the most popular code-based digital signature schemes today, but it suffers from the disadvantages of large keys and low signature efficiency. To solve these problems, this paper proposes two post-quantum digital signature schemes based on Quasi-Cyclic Medium Density Parity Check Code (QC-MDPC). Both schemes are characterized by small public key storage, low encryption and decryption complexity, and high security, which are of great significance in the field of cryptographic research against quantum attacks. Post-Quantum QC-MDPC Hash Function Digital Signature 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-5988828","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":414221086,"identity":"710489d3-1b53-4350-8eac-7b8fd7bac7b0","order_by":0,"name":"Yongfeng Niu","email":"","orcid":"","institution":"Changzhou University","correspondingAuthor":false,"prefix":"","firstName":"Yongfeng","middleName":"","lastName":"Niu","suffix":""},{"id":414221087,"identity":"4bb06e52-50e2-4988-ab48-0aa03a95caf5","order_by":1,"name":"Yuanyuan Lian","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABP0lEQVRIie2RMUvDQBTH33GQOKR2TThoN+crARGs9KskBOLSFMXFzUjgsqR7nPoZuoibCQftch9AyJJScHLIJC1k8NKCg43U0eF+ww3v7sf933sACsV/RA+drKLDBxThZVXJgqZ/3zntipGtVum97+CY+ShtFHxMMd21fSK4oyfiDBtN5ZjSDz2fIOZPOulYWw/r5/4pBlRtag5dfUxh+3Kg0Gzhk1s2vLPSYGkHrBgwDNhKDA5W8kHRVBwqKPHJk2xjnk4cEoQFkopsx+RA38YUI3YYLOp+kg7j6FU+IBd1MdorlMPoFwUW4NmG4O5jIs4JaIW7Vxz5i9muUAFuM2QbxcwbTFnhMYwiK8muDVO83+TTlmCzcrfKnlxlXm7q4moWR7mc2GWvG3vzctsSrAUUNuduR9mfBIVCoVD85AuVY3B12opL9gAAAABJRU5ErkJggg==","orcid":"","institution":"Changzhou University","correspondingAuthor":true,"prefix":"","firstName":"Yuanyuan","middleName":"","lastName":"Lian","suffix":""},{"id":414221089,"identity":"bdceb104-ebf1-4f12-bde9-7278ca6db559","order_by":2,"name":"Yizhuo Zhang","email":"","orcid":"","institution":"Changzhou University","correspondingAuthor":false,"prefix":"","firstName":"Yizhuo","middleName":"","lastName":"Zhang","suffix":""},{"id":414221090,"identity":"12d40ae9-ccad-479e-bf93-a2e4f29615db","order_by":3,"name":"Huiling Yu","email":"","orcid":"","institution":"Changzhou University","correspondingAuthor":false,"prefix":"","firstName":"Huiling","middleName":"","lastName":"Yu","suffix":""}],"badges":[],"createdAt":"2025-02-08 16:08:16","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-5988828/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-5988828/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":96249836,"identity":"703b3681-e210-4f27-9fce-ec15f5ef397f","added_by":"auto","created_at":"2025-11-19 07:36:24","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":280815,"visible":true,"origin":"","legend":"","description":"","filename":"MAIN.pdf","url":"https://assets-eu.researchsquare.com/files/rs-5988828/v1_covered_20d85aaf-d0bb-4588-8559-b363a951b32d.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Efficient Post-Quantum Digital Signature Schemes Using QC-MDPC","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, QC-MDPC, Hash Function, Digital Signature","lastPublishedDoi":"10.21203/rs.3.rs-5988828/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-5988828/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eWith the development of quantum computers and quantum attack algorithms, it is crucial to design digital signature algorithms that are resistant to quantum attacks. CFS scheme is one of the most popular code-based digital signature schemes today, but it suffers from the disadvantages of large keys and low signature efficiency. To solve these problems, this paper proposes two post-quantum digital signature schemes based on Quasi-Cyclic Medium Density Parity Check Code (QC-MDPC). Both schemes are characterized by small public key storage, low encryption and decryption complexity, and high security, which are of great significance in the field of cryptographic research against quantum attacks.\u003c/p\u003e","manuscriptTitle":"Efficient Post-Quantum Digital Signature Schemes Using QC-MDPC","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-02-13 05:31:01","doi":"10.21203/rs.3.rs-5988828/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":"d8acacc5-70b5-466a-a4bd-2aee0243dfbf","owner":[],"postedDate":"February 13th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2025-11-18T01:23:41+00:00","versionOfRecord":[],"versionCreatedAt":"2025-02-13 05:31:01","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-5988828","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-5988828","identity":"rs-5988828","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}