Research and implementation of four-prime RSA digital signature algorithm
XIAO Zhenjiu1,2,HU Chi1,CHEN Hong1
1. College of Software, Liaoning Technical University, Huludao Liaoning 125105,China
2. School of Computer, Communication University of China, Beijing 100024, China
Abstract：In order to improve the operation efficiency of big module RSA (Rivest-Shamir-Adleman) signature algorithm, four prime Chinese Remainder Theorem (CRT)-RSA digital signature was suggested in this paper. The Hash function SHA512 was used to produce message digest, and CRT combining with Montgomery algorithm was applied to optimize large number modular exponentiation. The security analysis and experiment show that the new algorithm can resist some common attacks, and it has some advantages in signature efficiency.
肖振久 胡驰 陈虹. 四素数RSA数字签名算法的研究与实现[J]. 计算机应用, 2013, 33(05): 1374-1377.
XIAO Zhenjiu HU Chi CHEN Hong. Research and implementation of four-prime RSA digital signature algorithm. Journal of Computer Applications, 2013, 33(05): 1374-1377.
2013, Vol. 33 
