一种大数模幂的快速实现方法  

A Fast Calculating Method for Large Data Mode Power

作　　者：谢建全[1] 

机构地区：[1]湖南财经高等专科学校

出　　处：《信息安全与通信保密》2006年第8期22-23,27,共3页Information Security and Communications Privacy

摘　　要：在密码算法中经常会遇到大整数的乘法。论文提出了对传统BR算法的改进方法,能明显提高大数模幂乘运算的效率,从而大大缩短加解密的时间,提高加解密的效率。The multiplication algorithm is always used in the cryptography algorithm. This paper presents an improved method on the traditional BR algorithm, and it can obtain higher efficiency of the product calculation of large modulus power. Hence, it will reduce the encryption and decryption time dramatically, and will improve the efficiency of the encryption and decryption.

关 键 词：公开密钥 快速算法 中国剩余定理 BR算法 

分 类 号：TN918[电子电信—通信与信息系统]