大数模幂乘算法的快速实现

High speed algorithm for implementation of large modular power multiplication

大素数的选取是构造RSA密钥的关键 ,在素数的产生及测试是RSA公钥系统中的一个重要研究课题。描述了公钥密码体制中DSA、RSA等数据加密算法的原理及加密、解密过程 ,分析了各种算法的性能和适用的场合 ,针对上述算法的计算量巨大的问题 ,给出了实现数据加密较好的方法。理论和实验表明 ,该算法用于实现RSA算法 。

The selection of large primes is the key to construct RSA secret key. The production and test of large prime is an important research subject in RSA public key system. The paper discusses the principle of public key cryptography, RSA algorithms, DSA algorithms and the process of cipher and decipher, and analyzes their characters and different applications. Aiming at problem of huge calculation, a better method of data cipher is proposed. Theory and experiment show that the new algorithm obtains higher efficiency.