RSA Blind Signature System Using Matrices Over Finite Field

RSA Blind Signature System Using Matrices Over Finite Field | 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 RSA Blind Signature System Using Matrices Over Finite Field S Sethupathi, A Manimaran This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7542768/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 Blind RSA Signature Scheme that enhances both security and anonymity by leveraging matrix operations over finite fields and semiring structures. Blind signatures—originally introduced by David Chaum—are critical for privacy-preserving applications such as electronic voting, digital cash, and anonymous authentication. Although conventional RSA-based blind signatures offer foundational security, they often fall short in terms of privacy, traceability, and computational efficiency, especially under emerging cryptographic challenges. To address these limitations, the proposed scheme incorporates Mersenne primes for robust key generation, structured matrix transformations, and cryptographic hash functions to achieve improved untraceability and support selective disclosure. This design significantly increases resistance to key recovery, forgery, unbinding, and man-in-the-middle attacks, enhancing the scheme’s robustness against both classical and quantum adversaries. Empirical evaluations indicate a measurable reduction in signing time compared to standard RSA implementations, while delivering a superior level of security. Keywords— Semiring, discrete logarithm problem, blind signature, digital signature, RSA, finite field, mersenne prime. Semiring discrete logarithm problem blind signature digital signature RSA finite field mersenne prime. 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-7542768","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":531701790,"identity":"5a8f3e3d-a5fe-4e03-9c3a-402721590959","order_by":0,"name":"S Sethupathi","email":"","orcid":"","institution":"Vellore Institute of Technology","correspondingAuthor":false,"prefix":"","firstName":"S","middleName":"","lastName":"Sethupathi","suffix":""},{"id":531701791,"identity":"fd102ad1-c335-496b-a931-c94c9cc1b078","order_by":1,"name":"A Manimaran","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA20lEQVRIiWNgGAWjYPACGx42ZuYDQIaEDLFa0uT42NkSQFp4iNVy2FiOn8cAxCKsRbf97MPPBX+YE9uYeT6/ulFjwcPAfvjoBnxazM6kG0vPbGMDauHdZp1zDOgwnrS0G3i1HEhjkOZt4AFrMc5hA2qR4DHDr+X8M+bfPH8kQA57ZpzzjxgtN9LYpHnYDIzZmHmYH+e2EaXlGZs1b1uCHBszmxlzbp8EDxtBv5xPY77N8+c/j3z/4cefc77VyfGzHz6GVwsyYJMAk8QqBwHmD6SoHgWjYBSMgpEDAPakPn8s13vHAAAAAElFTkSuQmCC","orcid":"","institution":"Vellore Institute of Technology","correspondingAuthor":true,"prefix":"","firstName":"A","middleName":"","lastName":"Manimaran","suffix":""}],"badges":[],"createdAt":"2025-09-05 09:23:15","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-7542768/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7542768/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":94037115,"identity":"a93f5bf7-0048-47ab-911c-f7bcd67431ec","added_by":"auto","created_at":"2025-10-21 16:50:34","extension":"json","order_by":0,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":3814,"visible":true,"origin":"","legend":"","description":"","filename":"81336d99470841289a40e866e686aada.json","url":"https://assets-eu.researchsquare.com/files/rs-7542768/v1/9e8bb580ce291365a09b2339.json"},{"id":97961794,"identity":"91b75560-843d-49f9-a73f-34e900248d09","added_by":"auto","created_at":"2025-12-11 08:54:43","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":2994346,"visible":true,"origin":"","legend":"","description":"","filename":"Paper3a.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7542768/v1_covered_02c88561-f7a0-4df4-9df6-7a219974a923.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"RSA Blind Signature System Using Matrices Over Finite Field","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":"Semiring, discrete logarithm problem, blind signature, digital signature, RSA, finite field, mersenne prime.","lastPublishedDoi":"10.21203/rs.3.rs-7542768/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7542768/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"This paper presents a novel Blind RSA Signature Scheme that enhances both security and anonymity by leveraging matrix operations over finite fields and semiring structures. Blind signatures—originally introduced by David Chaum—are critical for privacy-preserving applications such as electronic voting, digital cash, and anonymous authentication. Although conventional RSA-based blind signatures offer foundational security, they often fall short in terms of privacy, traceability, and computational efficiency, especially under emerging cryptographic challenges. To address these limitations, the proposed scheme incorporates Mersenne primes for robust key generation, structured matrix transformations, and cryptographic hash functions to achieve improved untraceability and support selective disclosure. This design significantly increases resistance to key recovery, forgery, unbinding, and man-in-the-middle attacks, enhancing the scheme’s robustness against both classical and quantum adversaries. Empirical evaluations indicate a measurable reduction in signing time compared to standard RSA implementations, while delivering a superior level of security. Keywords— Semiring, discrete logarithm problem, blind signature, digital signature, RSA, finite field, mersenne prime.","manuscriptTitle":"RSA Blind Signature System Using Matrices Over Finite Field","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-10-21 16:50:29","doi":"10.21203/rs.3.rs-7542768/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":"9e45e253-a58b-4f24-b49e-76272fcd3cf2","owner":[],"postedDate":"October 21st, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2025-12-11T08:54:34+00:00","versionOfRecord":[],"versionCreatedAt":"2025-10-21 16:50:29","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-7542768","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7542768","identity":"rs-7542768","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}