［1］ Diffie W, Hellman M. New Directions in Cryptography［J］. IEEE Trans on Information Theory,1976,22(6):644-654.
［2］ Wang Guilin. An Abuse-Free Fair Contract-Signing Protocol Based on the RSA Signature ［J］. IEEE Trans on information forensics and security,2010, 5(1):158-168.
［3］ Montgomery P L. Modular Multiplication Without Trial Division［J］. Mathematics of Computation,1985, 44(170):519-521.
［4］ 刘强, 佟冬, 程旭. 一款RSA 模乘幂运算器的设计与实现［J］. 电子学报,2005,33(5):923-927.
 Liu Qiang, Tong Dong, Cheng Xu. The Design and Implementation of a RSA Modular Exponentiator［J］. Acta Electronica Sinica,2005, 33(5):923-927.
［5］ Kwon T W, You C S, Heo W S, et al.  Two Implementation Methods of a 1024-bit RSA Cryptoprocessor Based on Modified Montgomery Algorithm［C］//The 2001 IEEE International Symposium on Circuits and Systems. Piscataway: IEEE Press, 2001: 650-653.
［6］ McIvor C, McLoone M, McCanny J V. Modified Montgomery Modular Multiplication and RSA Exponentiation Techniques［J］. IEE Proceedings-Computers and Digital Techniques, 2004, 151(6): 402-408.
［7］ Shieh Mingder, Chen Junhong, Wu Haoshuan, et al. A New Modular Exponentiation Architecture for Efficient Design of RSA Cryptosystem［J］. IEEE Trans on VLSI, 2008, 16(9): 1151-1161.
［8］ McIvor C, McLoone M, McCanny J V. Fast Montgomery Modular Multi-plication and RSA Cryptographic Processor Architectures［C］//Conference Record of the 37th Asilomar Conference on Signals, Systems, and Computers: Vol 1. Piscataway: IEEE Press, 2003: 379-384.
［9］ Zimmermann R. Binary Adder Architectures for Cell-Based VLSI and Their Synthesis［D］. Zurich: Swiss Federal Inst of Technology, 1997.
［10］ Omondi A, Premkumar B. Residue Number Systems: Theory and Implementation［M］. First Edition. London: Imperial College Press, 2007: 29.