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.
展开▼
机译:大型整数的分解给出了成功攻击RSA密码系统算法的方法。 Williams P + 1给出了我们这样的算法,以修改整数n;如果存在Prime Divisor P,则P + 1只有一个小的主要除数。在本文中,我们使用矩阵演示了该算法,并显示了该方法可以是广义的。
展开▼