基于RSA的数字签名算法及其快速实现

The Introduction and Fast Implementation of Digital Signature Algorithm Based on RSA

在基于RSA的数字签名算法中，直接决定实现效率的是大数模幂运算。对基于二进制的Montgomery算法进行了改进，并将其应用于大数的模幂运算中。改进后的算法在保证算法快速实现的同时，又节省了算法运算空间。

The efficiency of digital signature algorithm based on P.SA depends on the modular exponentiation of large integer. We improved the binary Montgomery algorithm and use it in the modular exponentiation of large integer. On the foundation of fast speed,the improved way can also save operation space.