摘要： 利用Karatsuba-Ofman算法的思想,改进了Montgomery模乘的CIOS实现算法:一方面,改进后的CIOS算法在时间效率上有较大提高,减少的乘法次数比率接近25%;另一方面,改进后的算法具有更好的并行性,能够实现两个乘法器的并行结构,适合于设计高速的RSA密码专用芯片。
关键词:
RSA密码体制,
Montgomery模乘,
CIOS算法,
Karatsuba-Ofman算法
Abstract: Montgomery algorithm is one of the most efficient algorithms implementing long integer modular multiplication in RSAcryptosystem. The CIOS method of Montgomery algorithm is improved via the idea of Karatsuba-Ofman algorithm,: the decrease rate amounts to nearly 25%. Furthermore, the improved CIOS algorithm can be implemented with parallel processing of two independent multiplications and is well suited to designing high-speed RSA crypto-chips.
中图分类号:
孔凡玉,于佳,李大兴. 一种改进的Montgomery模乘快速算法[J]. , 2005, 31(08): 6-.
KONG Fanyu, YU Jia, LI Daxing. An Improved Fast Montgomery Multiplication Algorithm[J]. , 2005, 31(08): 6-.