Modified Prime Number Factorization Algorithm (MPFA) For RSA Public Key Encryption
Kuldeep Singh1, Rajesh Verma2, Ritika Chehal3
1Kuldeep Singh, Department of Computer Science & Engineering,Jind Institute of Engineering and Technology, Jind, India.
2Dr. Rajesh Kr. Verma, Professor & Head, Deptt. Of CSE, Kurukshetra Institute of Technology & Management, Kurukshetra(Haryana),India.
3Ritika Chehal, Department of Computer Science & Engineering,Jind Institute of Engineering and Technology, Jind, India.
Manuscript received on September 01, 2012. | Revised Manuscript received on September 02, 2012. | Manuscript published on September 05, 2012. | PP: 204-206 | Volume-2 Issue-4, September 2012. | Retrieval Number: D0941082412/2012©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The Public key encryption security 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, Fermat Factorization method, Brent’s Factorization method and Pollard Rho Factorization method.
Keywords: Factorization Problem, MPFA, Public Key Cryptography, RSA Scheme..