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

Read the full article See related articles

Discuss this preprint

Start a discussion What are Sciety discussions?

Listed in

This article is not in any list yet, why not save it to one of your lists.
Log in to save this article

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.

Article activity feed