线性移位寄存器在安全RSA模数中应用的研究  

Research on secure RSA modulus based on linear feedback shift register applications

作　　者：姜正涛[1] 王勇[2] 王永滨[1] 王育民[3] 

机构地区：[1]中国传媒大学计算机学院,北京100024 [2]北京工业大学计算机学院,北京100022 [3]西安电子科技大学ISN国家重点实验室,陕西西安710071

出　　处：《通信学报》2010年第5期135-140,共6页Journal on Communications

基　　金：中国博士后科学基金资助项目(20060400035);国家自然科学基金资助项目(60672102;60473027;60963624);国家重点基础研究发展计划("973"计划)基金资助项目(2003AA144150);国家"211"工程学科建设基金资助项目;2009年度北京市文化创意产业发展专项基金资助项目~~

摘　　要：运用线性移位寄存器(LFSR)序列模2个不同素数时的周期一般不同这一性质,尝试构造分解另一类RSA模数的方法;指出对于RSA模数n=pq的一个素因子p,当p2+p+1,p3+p2+p+1,…其中之一仅含有小的素因子时,给出的算法能够分解合数n=pq,并给出了一个基于三级LFSR分解合数的实例来说明算法的具体运算步骤。根据该分解算法,在选取RSA模数时,为确保安全性,除避免已知的不安全因素以外,还需要保证n的素因子p满足p2+p+1,p3+p2+p+1,…均包含大的素因子。The periods of linear feedback shift register（LFSR） sequence modulo different primes were distinct in general.Using this property,a family of methods for factoring RSA modulus was constructed.For the RSA modulus n = pq,if the prime p satisfies that one of p^2＋p＋1,p^3＋p^2＋p＋1,…was composed of small primes factors,it proposed a method for factorizing the composite integer n=pq.An instance was proposed to illustrate the specific procedure of the proposed factoring algorithm.Based on this factoring algorithm,to make security assurance in selecting RSA modulus,and in addition to avoid the already known insecure factors,one should also make sure that the prime factor p of n must satisfy that each of the p^2＋p＋1,p^3＋p^2＋p＋1,…include a large prime factor.

关 键 词：LFSR 素数 整数分解 安全RSA模数 

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