基于自组装算法破译RSA公钥密码系统  

Decoding RSA public-key cryptosystem by algorithmic self-assembly

作　　者：程珍[1] 许进[2] 周康[3] 

机构地区：[1]浙江工业大学计算机科学与技术学院,浙江杭州310023 [2]北京大学信息科学技术学院,北京100871 [3]武汉工业学院数理科学系,湖北武汉430023

出　　处：《华中科技大学学报（自然科学版）》2011年第2期15-18,共4页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家高技术研究发展计划资助项目(2009AA012413);国家自然科学基金资助项目(60803113;60533010;Z1100455)

摘　　要：研究了如何利用自组装技术对公钥密码系统RSA进行密码分析,提出了破译RSA公钥密码系统的自组装算法.创建3个子系统,包括非确定性指派子系统、乘法子系统和比较子系统,在此基础上建立自组装模型,提出自组装非确定性算法将整数分解为2个素因子的乘积,该方法用常量种类的Tile类型在多项式时间内能成功分解整数,且通过其并行计算的特点破译RSA密码系统.Self-assembly technology was studied to cryptanalyze the RSA （rivest, shamir, adleman） public-key cryptosystem, and the algorithmic self-assembly was used to decode this cryptosystem by mainly constructing three small systems which are nondeterministic guess system, multiplication system, addition system and comparing system. Then, the nondeterministic algorithm was proposed to factor an integer into the product of two large prime numbers. This method can successfully factor integers in polynomial time with constant Tile types, then can decode the RSA public-key eryptosystem by parallel computing of self-assembly model.

关 键 词：自组装算法 自组装模型 分解整数 破译 公钥密码系统 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]