一种RSA算法之数字签名系统的快速实现方案

A Fast Implementation of Digital Signature System Based on RSA Algorithm

不同于常规的二进制幂模算法,该文采用一种更快速有效的滑动窗口法来实现幂模运算,同时结合Montgomery算法和中国剩余定理相结合来实现RSA签名,并给出了签名和验证的流程图。实验结果表明,以1024bit签名为例,采用滑动窗口算法比采用二进制算法要快22.3%;而综合采用滑动窗口和montgomery算法结合中国剩余定理,一次1024bit签名仅需28ms。

Different from binary method of modular exponentiation, the article introduces a faster and more effective sliding window method combined with Montgomery algorithm and the CRT（Chinese Remainder Theory）. The flow charts of signature and verification are also given. The experiment result shows that sliding window method is 22.3% faster than the binary method. Meanwhile, it takes only 28ms to do a 1 024bit signature.