快速大数模乘算法的研究与分析.pdfVIP

快速大数模乘算法的研究与分析 摘要 大数模乘对于RSA公钥密码体系和椭圆曲线公钥密码体系来讲，都是最基本的模乘。首先分析 了Blakley大数模乘算法，对算法的 杂度和效率进行了分析，这种算法具有基础性但效率低下；其 次，在Blakley大数模乘算法的基础上提出窗口模乘算法，采取简化处理和提高效率的思想，并且对 于被乘数和乘数的处理，采取冗余二进制位技术，对乘数进行编码和预先计算，这样处理的结果使 得计算 杂程度大大降低；最终，对窗口模乘算法进行试验，试验采取网上典型数据集，测试结果表 明窗口模乘算法比Blakley大数模乘算法的效率更高。 关键词 大数模乘；算法分析；滑动窗口；算法 杂度 Research and Analysis of Fast Large Number Modular Multiplication Algorithms Abstract Large number modular multiplication is the most basic modular multiplication for RSA public key cryptosystem and elliptic curve public key cryptosystem. Firstly, Blakleys modular multiplication algorithm is analyzed, and its complexity and efficiency are analyzed. This algorithm is basic but inefficient. Secondly, on the basis of Blakleys modular multiplication algorithm, a window modular multiplication algorithm is proposed. The idea of simplifying and improving efficiency is adopted. For the processing of multiplicands and multipliers, redundant binary bit technology is adopted to process multipliers. The results of encoding and pre-calculation make the computational complexity greatly reduced. Finally, the window modular multiplication algorithm is experimented with typical data sets on the Internet. The test results show that the window modular multiplication algorithm is more efficient than Blakleys large modular multiplication algorithm. Key words large modulus multiplication; algorithm analysis; sliding window; algorithm complexity 1 绪论 1.1 研究背景与意义 随着当今社会网 化程度越来越高，人们在工作、生活中对信息的依赖程度越来越高，在网 化时代算法改变人们的工作和生活，对信息进行爱护