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

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

作　　者：周利荣[1] 

机构地区：[1]衢州职业技术学院信息工程学院,浙江衢州324000

出　　处：《电脑编程技巧与维护》2014年第4期13-15,17,共4页Computer Programming Skills & Maintenance

基　　金：衢州职业技术学院科研项目;项目编号:QZYY1322

摘　　要：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.

关 键 词：RSA模 递归调用 深度优先遍历 

分 类 号：TN918.4[电子电信—通信与信息系统]