Welcome to JJEM: A Multi-Disicplinary Journal of JNNCE, Shimoga

JJEM Eleventh Issue - Volume 6 Number 1 -2022

Volume 6, Issue 1

A Comprehensive study on RSA Prime Factorization Algorithms

Published:    2022-07-31


Murthy D H R


RSA is the well-known Public Key Cryptographic Algorithm invented in 1985 which is more powerful even today because of its hardness in factoring the public modulus. The algorithm begins by considering two large prime numbers and all the remaining calculations are based on these two numbers. Once we are able to find any one prime factor successfully from the Public modulus which leads to cracking RSA. Many Cryptographers working hard to find a novel approaches for factorization. This paper deals with the study of different algorithms used for factorization and their key features in RSA. In the concluding part of this paper, the Author would like to explain a novel approach which looks fair for Carmichael Numbers.


Public Key Cryptography; RSA; Prime Numbers; Factorization