Shieh M D, Chen J H, Wu H H, et al. A new modular exponentiation architecture for efficient design of RSA cryptosystem[J]. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2008, 16(9): 1151-1161. DOI: 1151

Kawamura S, Koike M, Sano F, et al. Cox-rower architecture for fast parallel montgomery multiplication[C]// Advances in Cryptology - EUROCRYPT 2000, International Conference on the Theory and Application of Cryptographic Techniques. Bruges, Belgium, 2000: 523-538.

Montgomery P L. Modular multiplication without trial division[J]. Mathematics of Computation, 1985, 44(17): 519-521. DOI: 519

Néto J C, Tenca A F, Ruggiero W V. CRT RSA decryption: modular exponentiation based solely on montgomery multiplication[C]//Signals, Systems and Computers, 2015 49th Asilomar Conference on. Pacific Grove, CA, USA, IEEE, 2015: 431-436.

Nozaki H, Motoyama M, Shimbo A, et al. Implementation of RSA algorithm based on RNS montgomery multiplication[C]//International Workshop on Cryptographic Hardware and Embedded Systems. Springer, Berlin, Heidelberg, 2001: 364-376.

Rivest R L, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystems[J]. Communications of the ACM, 1978, 21(2): 120-126. DOI: 120

Gandino F, Lamberti F, Paravati G, et al. An algorithmic and architectural study on Montgomery exponentiation in RNS[J]. IEEE Transactions on Computers, 2012, 61(8): 1071-1083. DOI: 1071

麻永新, 曾晓洋, 吴敏, 等. 基于Barrett模乘算法的RSA密码协处理器设计[J]. 系统工程与电子技术, 2006, 28(6): 830-833. DOI: 830

Tao W U, Shuguo L I, Liu L T. Fast RSA decryption through high-radix scalable montgomery modular multipliers[J]. Science China Information Sciences, 2015, 58(6): 1-16. DOI: 1