Title: Security Implementation Using RSA and Enhanced RSA

Issue Number: Vol. 9, No. 3
Year of Publication: Sep - 2020
Page Numbers: 139-146
Authors: Vanitha Kumar, Varada Sandeep Kumar, Dara Anil Kumar Dara
Journal Name: International Journal of Cyber-Security and Digital Forensics (IJCSDF)
- Hong Kong
DOI:  http://dx.doi.org/10.17781/P002662


Today, RSA calculation is the most broadly utilized open key cryptosystem around the globe. It is utilized for security in everything from internet shopping to phones. In any case, the essential RSA isn't semantically secure, since encoding a similar message more than once consistently gives the equivalent cipher text. Consequently, the essential RSA is helpless against set of backhanded assaults, for example, known plaintext, picked plaintext, timing, basic modulus, and recurrence of squares assaults. In addition, RSA is known to be much more slow than the norms symmetric key encryption and it doesn't utilize for encoding huge information. This paper presents an altered methodology which is an improvement over conventional RSA calculation by including exponential forces, n prime numbers, numerous open keys, and K-NN calculation. Changed methodology additionally gives highlight of check at both side's sender and recipient.