面向PKCS的两种大数模运算算法的测试与分析

Testing and Analyses about Two Algorithms of Modular Arithmetic for PKCS

比较分析了两种面向PKCS的快速模运算算法——单表制算法和双表制算法，给出了这两种算法的时空复杂性。着重对这两个算法进行了对比测试。结果表明：双表制算法较单表制算法提高效率30％～50％，同时双表制算法以递推方式建立预计算表提高了预计算效率180％～490％，为公钥动态管理提供便利；以大数运算在RSA中的应用为例，比较分析出采用双表制算法的加／解密模运算过程较单表制算法的过程提高效率20％～50％。

Two algorithms of module based on precomputer (Single-Table Algorithms -STA and Double-Table Algorithms-DTA) are compared and analyzed. The complexity of the two algorithms is reported in this paper. The results drawn from the test show that the DTA is more efficient than the STA by 30% - 50%. Meanwhile, the precomputation of DTA is more efficient than that of STA by 180% - 490%- Morerever, accordiing to the results of the test it is expected that a precess ofRSA encryption and decryption could be more faster than that by STA by 20% - 50%.