基于偶次幂因子分解的RSA快速算法

提出了一种基于偶次幂因子分解的RSA快速实现算法的设想，这种算法是针对传统BR算法的缺点实现的，在计算高次幂幂剩余和乘同余时结合采用数据库、偶次幂指数分解的方法进行，通过将指数幂凑成满足2的整数幂来降低汉时重量，减少循环步骤，同时利用偶次幂的对称性提高运算速度．理论分析与实验结果表明该算法与BR算法相比，缩小了近33％的循环步骤，乘法步数平均减少25％，求模的步数平均减少37．4％．

Factorization of Even-power-based RSA Fast Algorithm

By analyzing BR(conventional binary representation)algorithm,a new fast algorithm is proposed. The new algorithm,based on factorization of even power, aims at overcoming the shortcomings of the BR algorithm. In order to reduce Hamming_weight and improve the speed of calculation,the authors,by using database and decomposing even power,make up exponent and make use of symmetrical even power. during the process of calculation module multipl:cation. The theoretical analysis and the experimental results verify the advantages of the new algorithm over the BR algorithm. The circulatory steps are reduced by 33%, the multiplicative steps are reduced by 25%, the modular steps are reduced 37. 4%.