［1］Montgomery P L. Modular multiplication without trial division［J］. Mathematics of  Computation, 1985, 44(170):519521.
［2］Tenca A F, Ko  K. A scalable architecture for Montgomery multiplication［C］∥Proc of Cryptographic Hardware and Embedded Systems, 1999:94108.
［3］Huang M, Gaj K, ElGhazawi T. New hardware architectures for Montgomery modular multiplication algorithm［J］. IEEE Transactions on  Computers, 2011, 60(7):923936.
［4］McIvor C, McLoone M, McCanny J V. Highradix systolic modular multiplication on reconfigurable hardware［C］∥Proc of IEEE International Conference on FieldProgrammable Technology, 2005:1318.
［5］Zhou L, Huang M, Smith S C. Highperformance and areaefficient hardware design for radix 2k Montgomery multipliers［C］∥Proc of International Conference on Computer Design, 2011:1.
［6］Batina L, Muurling G. Montgomery in practice:How to do it more efficiently in hardware［C］∥Proc of Topics in Cryptology, the Cryptographer’s Track at the RSA Conference, 2002:4052.
［7］Walter C D. Montgomery’s multiplication technique:How to make it smaller and faster［C］∥Proc of Cryptographic Hardware and Embedded Systems, 1999:8093.
［8］rs S B, Batina L, Preneel B, et al. Hardware implementation of elliptic curve processor over GF(p)［C］∥Proc of IEEE International Conference on ApplicationSpecific Systems, Architectures and Processors, 2003:433443.