An Efficient Method to Factorize the RSA Public Key Encryption
Babasaheb Ambedkar, Ashwani Gupta, Pratiksha Gautam, S. S. Bedi · 2011
The security of public key encryption such as RSA scheme relied on the integer factoring problem. The security of RSA algorithm based on positive integer N, which is the product of two prime numbers, the factorization of N is very intricate. In this paper a factorization method is proposed, which is used to obtain the factor of positive integer N. The present work focuses on factorization of all trivial and nontrivial integer numbers as per Fermat method and requires fewer steps for factorization process of RSA modulus N. By experimental results it has been shown that factorization speed becomes increasing as compare to traditional Trial Division method.