Double Key Pair and Hidden Modulus RSA Cryptosystem

Double Key Pair and Hidden Modulus RSA Cryptosystem | 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 Double Key Pair and Hidden Modulus RSA Cryptosystem Getaneh Awulachew, Samuel Asferaw This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4655782/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 Data security is that the primary concern of every individual and organization. To assure the security of data, cryptography is the prime mechanism. RSA is most widely accepted as a reliable asymmetric key cryptography. Since, its reliability depends on the hardness of factoring large common modulus which is accessible for the public, this accessibility of the common modulus could exposed RSA to various cryptanalysis attacks: Shor’s quantum polynomial-time algorithm, D-Wave quantum computer attacks, double encryption attack, and low private exponent attack. To address this weaknesses, this paper proposes an asymmetric key cryptosystem named as Double Key Pair and Hidden Modulus RSA (DKPHM-RSA) which introduces additional key pair, and the public mask modulus which is a pseudo random masking number derived from real modulus. Replacing the second real modulus, this derived public mask modulus is introduced in a second public key component; as a result, a second real modulus kept hidden from the public unlike the case in RSA. To improve data security, additional public key exponent along with public mask modulus are used for second encryption while additional private key with additional real modulus is used for the first decryption process. For performance analysis Net bean IDE 8.2 is used, and the proposed DKPHM-RSA algorithm is compared with state-of-the-art algorithms: RSA, ESRKGS, HRM-RSA, and MRSA based on key generation speed, encryption speed, decryption speed, time complexity, resistance to attacks, and avalanche effect. The performance analysis shows that DKPHM-RSA is less complex and highly secured than state-of-the-art algorithms. It improves key generation speed of ESRKGS, and MRSA by 298%, 31%; encryption time of RSA, ESRKGS, MRSA, HRM-RSA by 34%, 263%, 1331%, 33%; decryption speed of ESRKGS, MRSA by 51%, 404%, respectively. cryptography double key pair masking RSA security 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-4655782","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":323610748,"identity":"1a1c6ac2-ad42-4f5b-8e28-9215f2a1656f","order_by":0,"name":"Getaneh Awulachew","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA/ElEQVRIiWNgGAWjYBADGQYGHiBVAcTMzA0EFDODSR6IljMgAUZStDC2gdgEtMi79x9g+Nl2mIe//ezBx7zzaqP524FaflRsw6nF8MxhBsZeoBaJM3nJxrzbjufOOMzYwNhz5jZuLTOSGRh4tx3mYbjBYyadu+1YbgNQCzNjGx4t8x8zMP4FapG/wWP+O3fOsdz5hLTISzAzMINsMQDawpzbUJO7gZAWA55kg8Oy/9J5DM/kGEv/OXYgdyNQy0F8fpFvP/jw4Zsz1nJyx88YfpxRU5c77/zhgw9+VOCx5QADwwEk/mEweQCLSoQtDaj8OnyKR8EoGAWjYIQCABPBWeTldbHWAAAAAElFTkSuQmCC","orcid":"","institution":"Debre Berhan University Debre Berhan","correspondingAuthor":true,"prefix":"","firstName":"Getaneh","middleName":"","lastName":"Awulachew","suffix":""},{"id":323610749,"identity":"ef80b016-dfb0-4203-a236-580645cebda9","order_by":1,"name":"Samuel Asferaw","email":"","orcid":"","institution":"Debre Berhan University Debre Berhan","correspondingAuthor":false,"prefix":"","firstName":"Samuel","middleName":"","lastName":"Asferaw","suffix":""}],"badges":[],"createdAt":"2024-06-28 15:44:21","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4655782/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4655782/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":64876567,"identity":"941d4ac6-4c24-470b-baf6-5f9eae864dfd","added_by":"auto","created_at":"2024-09-20 01:54:52","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":476724,"visible":true,"origin":"","legend":"","description":"","filename":"DKPHMRSA042024.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4655782/v1_covered_18d4b972-d8cf-4336-b1fb-a333b03b05ef.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Double Key Pair and Hidden Modulus RSA Cryptosystem","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":"cryptography, double key pair, masking, RSA, security","lastPublishedDoi":"10.21203/rs.3.rs-4655782/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4655782/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eData security is that the primary concern of every individual and organization. To assure the security of data, cryptography is the prime mechanism. RSA is most widely accepted as a reliable asymmetric key cryptography. Since, its reliability depends on the hardness of factoring large common modulus which is accessible for the public, this accessibility of the common modulus could exposed RSA to various cryptanalysis attacks: Shor’s quantum polynomial-time algorithm, D-Wave quantum computer attacks, double encryption attack, and low private exponent attack. To address this weaknesses, this paper proposes an asymmetric key cryptosystem named as Double Key Pair and Hidden Modulus RSA (DKPHM-RSA) which introduces additional key pair, and the public mask modulus which is a pseudo random masking number derived from real modulus. Replacing the second real modulus, this derived public mask modulus is introduced in a second public key component; as a result, a second real modulus kept hidden from the public unlike the case in RSA. To improve data security, additional public key exponent along with public mask modulus are used for second encryption while additional private key with additional real modulus is used for the first decryption process. For performance analysis Net bean IDE 8.2 is used, and the proposed DKPHM-RSA algorithm is compared with state-of-the-art algorithms: RSA, ESRKGS, HRM-RSA, and MRSA based on key generation speed, encryption speed, decryption speed, time complexity, resistance to attacks, and avalanche effect. The performance analysis shows that DKPHM-RSA is less complex and highly secured than state-of-the-art algorithms. It improves key generation speed of ESRKGS, and MRSA by 298%, 31%; encryption time of RSA, ESRKGS, MRSA, HRM-RSA by 34%, 263%, 1331%, 33%; decryption speed of ESRKGS, MRSA by 51%, 404%, respectively.\u003c/p\u003e","manuscriptTitle":"Double Key Pair and Hidden Modulus RSA Cryptosystem","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-09-20 01:46:45","doi":"10.21203/rs.3.rs-4655782/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":"09b76370-c107-4988-9015-2d651d664256","owner":[],"postedDate":"September 20th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2024-09-20T01:46:45+00:00","versionOfRecord":[],"versionCreatedAt":"2024-09-20 01:46:45","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4655782","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4655782","identity":"rs-4655782","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}