Parallelized radix-4 scalable montgomery multipliers

This paper describes a parallelized radix-4 scalable Montgomery multiplier implementation. The design does not require hardware multipliers, and uses parallelized multiplication to shorten the critical path. By left-shifting the sources rather than right-shifting the result, the latency between processing elements is shortened from two cycles to nearly one. The new design can perform 1024-bit modular exponentiation in 8.7 ms and 256-bit exponentiation in 0.36 ms using 5916 Virtex2 4-input lookup tables. This is comparable to radix-2 for long multiplies and nearly twice as fast for short ones.

[1]  Gang Wang,et al.  A modified high-radix scalable Montgomery multiplier , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[2]  Christof Paar,et al.  High-Radix Montgomery Modular Exponentiation on Reconfigurable Hardware , 2001, IEEE Trans. Computers.

[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.  Parallelized radix-2 scalable Montgomery multiplier , 2007, 2007 IFIP International Conference on Very Large Scale Integration.

[6]  Çetin Kaya Koç,et al.  High-Radix Design of a Scalable Modular Multiplier , 2001, CHES.

[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..

[8]  Lo'ai Tawalbeh,et al.  An efficient and scalable radix-4 modular multiplier design using recoding techniques , 2003, The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003.

[9]  C. D. Walter,et al.  Montgomery exponentiation needs no final subtractions , 1999 .

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

[11]  Jean-Jacques Quisquater,et al.  Montgomery Exponentiation with no Final Subtractions: Improved Results , 2000, CHES.

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

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