云计算在RSA密码体制分析中的应用  

The Applications of Cloud Computing in RSA Cryptosystem Analysis

作　　者：刘倩[1] 范安东[1] 许凌云[1] 任泽明[1] 

机构地区：[1]成都理工大学应用数学系,四川成都610059

出　　处：《数学的实践与认识》2014年第3期108-114,共7页Mathematics in Practice and Theory

基　　金：四川省应用基础计划项目(2012JY0033);国土资源部地学空间信息技术重点实验开放基金(KLGSIT2013-08)

摘　　要：RSA是著名的公钥密码体制之一,其安全性是基于大整数因子分解困难性假设的,求解RSA问题的最直接方法是分解RSA的模数.由于云计算的大规模分布式计算能力,一些使用分布式计算模型MapReduce的大整数分解手段已经实现,针对大整数因子分解的问题,提出了给定范围内搜索因子的新方法,并对相应的实验数据和结果进行了分析.结果表明,在云中的分布式计算的运行时间远小于单台机器.RSA is one of the weu-knawn public key cryptosystems,and its security is based on the difficult assumption of large integer decomposition,the direct way for Solving RSA problem is to decompose of RSAS mod.With the ability of mass computing of the distributed computing of cloud,some steps of large integer decomposition have been implemented by using the distributed computing model MapReduce.Considering the problem of large integer decomposition,new methods to search factors among a group of specified integers are given,and then the corresponding experimental datum and results are analyzed.The results show that the running time of distributed computing in the cloud is less than single machine.

关 键 词：云计算 RSA密码体制分析 大整数分解 

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