Security and Efficiency Evaluation of RSA Algorithm with Multiple Key Sizes Using Python and Web-Based Platforms

preprint OA: closed
Full text JSON View at publisher
AI-generated summary by claude@2026-07, 2026-07-14

This study implements and evaluates the RSA algorithm in Python across multiple key sizes, analyzing its efficiency and security through performance metrics and exploring potential improvements.

One-sentence paraphrase of the abstract; not a substitute for reading it. No clinical advice. How this works

AI-generated deep summary by claude@2026-07, 2026-07-14 · read from full text

This preprint analyzes the RSA public key cryptosystem by implementing RSA in Python with varying key sizes and measuring performance for key generation, encryption, and decryption time, alongside assessed security strength using tables and graphs. It covers RSA encryption/decryption workflows and mathematical principles, compares RSA keys using defined system specifications, and also discusses the use of common Python cryptographic libraries. The authors additionally claim to modify or compare “improvements” to address RSA’s reliance on integer factorization for security, particularly for small numbers, aiming to increase security and speed up cryptographic operations. The paper is not peer reviewed and provides limited methodological detail in the abstract, which constrains interpretation of the results. This paper does not explicitly discuss endometriosis or adenomyosis; it was included in the corpus via a keyword match in the upstream search index.

Read from the paper's body, not the abstract. Not a substitute for reading the paper. No clinical advice. How this works

Abstract

Abstract This paper offers a comprehensive analysis of the RSA public key cryptosystem, focusingon its security and efficiency. The size of the key used determines how the RSA algorithmis evaluated. In this study, a Python implementation of the RSA algorithm with varying key sizes is presented, and the performance in terms of key generation, encryption, anddecryption time is examined. Tables and graphical representations are used to display theresults.The processes of encryption, decoding, key creation, and mathematical principles are covered. System specs are used to compare various RSA keys. Various key sizes andpre-made graphs for encryption time, decryption time, and security strength are used to assess performance. The use of common cryptographic libraries for Python imple-mentation is also covered.In order to create a more secure RSA algorithm, this researchstudy attempts to modify the RSA algorithm.RSA cryptosystem algorithm is widely usedcryptographic algorithm in network security but it has problem of integer’s factorisation for small numbers. This study presents and compares a number of RSA cryptosystemimprovements that aim to increase security and expedite the encryption and decryption process.
Full text 10,115 characters · extracted from preprint-html · click to expand
Security and Efficiency Evaluation of RSA Algorithm with Multiple Key Sizes Using Python and Web-Based Platforms | 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 Security and Efficiency Evaluation of RSA Algorithm with Multiple Key Sizes Using Python and Web-Based Platforms Sonam Gawande, Kailas Ahire This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-9006567/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 offers a comprehensive analysis of the RSA public key cryptosystem, focusingon its security and efficiency. The size of the key used determines how the RSA algorithmis evaluated. In this study, a Python implementation of the RSA algorithm with varying key sizes is presented, and the performance in terms of key generation, encryption, anddecryption time is examined. Tables and graphical representations are used to display theresults.The processes of encryption, decoding, key creation, and mathematical principles are covered. System specs are used to compare various RSA keys. Various key sizes andpre-made graphs for encryption time, decryption time, and security strength are used to assess performance. The use of common cryptographic libraries for Python imple-mentation is also covered.In order to create a more secure RSA algorithm, this researchstudy attempts to modify the RSA algorithm.RSA cryptosystem algorithm is widely usedcryptographic algorithm in network security but it has problem of integer’s factorisation for small numbers. This study presents and compares a number of RSA cryptosystemimprovements that aim to increase security and expedite the encryption and decryption process. Public key cryptography RSA Encryption Decryption Python and web tools 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-9006567","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":599061355,"identity":"c5470456-cfbc-42de-8dac-78e1e96da93c","order_by":0,"name":"Sonam Gawande","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA9UlEQVRIiWNgGAWjYHCDBPYfH4AUGzsJWhgkZ4C0MJOiRZoHRBPSIt/ee/Djl5rD8ubsyQeMbX5tk+djZmD88DEHtxaDM+eSpWWOHTbc2fMsITm377ZhGzMDs+TMbXi0SOQYSEuw3WbccCPH4HBuz21GoBY2Zl48WuRn5Bj/lvh3237DjfyPzZY9t+0JamG4kWMm+bHtdiLQFmZmhh+3EwlqMThzxsyase9/8oYzz8wYextuJ7cxMzbj9Yt8e4/xzR/f0mw3HE9+xvDjz23b+e3NBz98xOcwIGDmgbEY28BkA371ICU/4Mw/BBWPglEwCkbBCAQAG7VVWwY14wIAAAAASUVORK5CYII=","orcid":"","institution":"Mahatma Gandhi Vidyamandir's Maharaja Sayajirao Gaikwad Arts, Science \u0026 Commerce College Tal. Malegaon, Dist. Nashik","correspondingAuthor":true,"prefix":"","firstName":"Sonam","middleName":"","lastName":"Gawande","suffix":""},{"id":599061356,"identity":"fdb010c4-558e-4665-afdd-b0247d690140","order_by":1,"name":"Kailas Ahire","email":"","orcid":"","institution":"Mahatma Gandhi Vidyamandir's Maharaja Sayajirao Gaikwad Arts, Science \u0026 Commerce College Tal. Malegaon, Dist. Nashik","correspondingAuthor":false,"prefix":"","firstName":"Kailas","middleName":"","lastName":"Ahire","suffix":""}],"badges":[],"createdAt":"2026-03-02 06:53:55","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-9006567/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-9006567/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":104400819,"identity":"8145236a-0762-478b-96f8-6510219797c3","added_by":"auto","created_at":"2026-03-11 12:11:10","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":796666,"visible":true,"origin":"","legend":"","description":"","filename":"SecurityandEfficiencyEvaluationofRSAAlgorithmwithMultipleKeySizesUsingPythonandWebBasedPlatforms1.pdf","url":"https://assets-eu.researchsquare.com/files/rs-9006567/v1_covered_2cb3699a-0144-4a82-9623-c38bfadaf349.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"\u003cp\u003eSecurity and Efficiency Evaluation of RSA Algorithm with Multiple Key Sizes Using Python and Web-Based Platforms\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":"Public key cryptography, RSA, Encryption, Decryption, Python and web tools","lastPublishedDoi":"10.21203/rs.3.rs-9006567/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-9006567/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"This paper offers a comprehensive analysis of the RSA public key cryptosystem, focusingon its security and efficiency. The size of the key used determines how the RSA algorithmis evaluated. In this study, a Python implementation of the RSA algorithm with varying key sizes is presented, and the performance in terms of key generation, encryption, anddecryption time is examined. Tables and graphical representations are used to display theresults.The processes of encryption, decoding, key creation, and mathematical principles are covered. System specs are used to compare various RSA keys. Various key sizes andpre-made graphs for encryption time, decryption time, and security strength are used to assess performance. The use of common cryptographic libraries for Python imple-mentation is also covered.In order to create a more secure RSA algorithm, this researchstudy attempts to modify the RSA algorithm.RSA cryptosystem algorithm is widely usedcryptographic algorithm in network security but it has problem of integer’s factorisation for small numbers. This study presents and compares a number of RSA cryptosystemimprovements that aim to increase security and expedite the encryption and decryption process.","manuscriptTitle":"Security and Efficiency Evaluation of RSA Algorithm with Multiple Key Sizes Using Python and Web-Based Platforms","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-03-03 14:00:13","doi":"10.21203/rs.3.rs-9006567/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":"08901152-b517-4bdd-a6d3-2c3c718c1019","owner":[],"postedDate":"March 3rd, 2026","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2026-03-06T13:26:15+00:00","versionOfRecord":[],"versionCreatedAt":"2026-03-03 14:00:13","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-9006567","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-9006567","identity":"rs-9006567","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","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.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2026) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00