Parallelized radix-2 scalable Montgomery multiplier

This paper describes the FPGA implementation of a parallelized scalable radix-2 Montgomery multiplier. It improves upon previous designs by rearranging previously sequential calculations to take place in parallel. On a Virtex-II FPGA, this design can perform 1024-bit modular exponentiation in 6.3 ms using 6006 lookup tables, a 17 % speed improvement over the previously fastest scalable radix-2 Montgomery multiplier.

[1]  P. L. Montgomery.  Modular multiplication without trial division , 1985 .

[2]  Sanu Mathew,et al.  An improved unified scalable radix-2 Montgomery multiplier , 2005, 17th IEEE Symposium on Computer Arithmetic (ARITH'05).

[3]  Holger Orup,et al.  Simplifying quotient determination in high-radix modular multiplication , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.

[4]  David Money Harris,et al.  Very high radix scalable Montgomery multipliers , 2005, Fifth International Workshop on System-on-Chip for Real-Time Applications (IWSOC'05).

[5]  Nan Jiang,et al.  Quotient Pipelined Very High Radix Scalable Montgomery Multipliers , 2006, 2006 Fortieth Asilomar Conference on Signals, Systems and Computers.

[6]  Çetin Kaya Koç,et al.  A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm , 2003, IEEE Trans. Computers.

[7]  D. Harris,et al.  Parallelized Very High Radix Scalable Montgomery Multipliers , 2005, Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005..