基于递归函数调用的深度优先遍历分解RSA模算法

Based on a Recursive Function Call Depth-First Traversal Algorithm to Decompose RSA Modulus

RSA公钥加密算法基于大整数分解的困难性,提出了基于递归函数调用的深度优先遍历算法分解RSA模,在分析大整数相乘和分解的性质的基础上实现深度优先遍历算法分解大整数,并进行改进以实现并行运算,成功分解RSA-22。

RSA public key encryption algorithm based on the difficulty of large integer factorization, In this paper Propose depth-first traversal algorithm to decompose RSA modulus that based on a recursive function call ,on the basis of analyzing large integer multiplication and decomposition, realized the depth-first traversal algorithm for factoring large integers, and made improvements in order to achieve parallel computing, decomposed RSA-22 successfully.