A p^2+p+1 Factoring Algorithm and Cryptography

Abstract

Factorization of large integers gives a method to successfully attack on RSA cryptosystem algorithm. Williams p+1 gives us such algorithm to factorize the integer n; if there exists a prime divisor p, such that p+1 will have only a small prime divisors. In this paper we demonstrate this algorithm using matrices and show that the method can be generalized.