一种新的基于分布式的RSA模数分解算法

RSA公开密钥算法的安全机制是基于大整数分解的复杂性,目前,对大整数的分解最有效的三种算法分别为二次筛法、椭圆曲线分解法和数域筛法。本文先对上述三种算法进行概要分析,然后给出一种新的基于分布式的RSA模数分解算法,并且对该算法进行时间复杂度分析,同时为该算法设计了基于分布式的实现模型。

The security of RSA public key cryptosystems relies on the difficulty of factoring very large numbers.Now,the three fastest factoring algorithms include separately the quadratic sieve,the elliptic curve method and the number field sieve.Firstly,this paper gives an outline analysis about the three algorithms.After that,a new algorithm for factoring RSA modulus based on distribution will be put forward.And we give time complexity analysis about the algorithm and its implementation frame based on distribution.Finally,we give the prospect and summary about the algorithm.