大整数基本运算研究报告与实现分析.docxVIP

大整数乘法的实现与分析 摘要 随着计算机信息安全要求的不断提高，密码学被大量应用到生活中。 RSA、 EIGamal、DSA、ECC等公钥密码算法和数字签名算法都建立在大整数运算的基础上， 比较耗时的大整数乘法、除法、模乘、幕运算、幕乘等运算却被上述算法大量使用， 它们的运算速度对这些算法的高效实现起着重要的作用，如何快速实现上述几种运算 是公钥密码领域普遍关注的热点问题。 本文基于32位的系统，首先采用模块化的思想建立大整数运算库的基础框架，在 实现一些辅助函数后在此框架上讨论并实现多精度大整数的基本加法、减法、乘法、 除法、平方算法、缩减、模乘、模幕乘等算法。所用程序均米用 C/C++语言编写，所 采用的优化也均建立在 C/C++语言这一层面上，在保证算法有足够高的效率的同时力 求代码清晰易懂，函数接口简单明了，具有可移植性和稳定性。 关键词：多精度大整数，Comba, Montgomery，二分查找，笔算 注：本设计 ＜论文）题目来源于企业工程。 Abstract Nowadays, as computer information security requirements improve continuously, the cryptology has been widely applied to life. Public key cryptographic algorithms and digital sig nature algorithms such as RSA, ElGamal, DSA, ECC are all base on multiple precisi on arithmetic. Multiple precision multiplication, Division, modular multiplication ,exponen- tiation, modular exponentiation which need more working time is used by public key cryptographic algorithms widely, their speed is very importa nt to the impleme ntatio ns of those algorithms. How to fast implement those arithmetic above is the hot topic in the public key cryptographic field. This paper is based on the 32 bit system. First of all,we found the modular foundation of multiple precision arithmetic library。After some auxiliary function is formed, we discuss and impleme nt the multiple precisi on in teger basic additi on ,Subtracti on, multiplicati on,, kinds of square algorithms,divisio n, reduct ion, and some relati onal fun cti on. All the algorithm discuss in this paper is implement entirely in portable ISO C/C++and the optimization of those algorithms implementations is built on the C/C++ Ianguage level. the algorithm has high eno ugh to en sure the efficie ncy of the code at the same time strive to clearly un dersta nd, simple in terface function with portability and stability. Key words：Multiple Precisio n In teger,Comba,M on tgomery,B inary search, Writte n calculati on 目录 个人资料整理 仅限学习使用 1绪论 1.1题目的背景 科学技术和网络的发展使计算机深入到了各行业的方方面面，计算机在带来方便和提 高了工作效率的同时却也带来了各种各样的新问题，其中信息安全问题