New Factoring Algorithm: Prime Factoring Algorithm

Network security is to protect the system to the unauthorized access or threads. The threads which are viruses, Trojan horses, spywares, worms, adware, zero hour attacks, DOS attacks and many other attacks. Many algorithms are used in network security for saving attackers. The RSA algorithm is mostly used in network security. The function of the RSA is to extend the safe the data. RSA is based on concrete problem of factoring which is the product of two prime numbers; this problem is a factoring problem. In this paper, we are developing the new Factoring algorithm which is Prime Factoring (PF) Algorithm and then analyzing the performance of different Fermat Factoring Algorithms which are Modified Fermat Factoring Algorithms V2 and Modified Fermat Factoring Algorithms V3 compare with Prime Factoring algorithm.