Efficient VLSI Implementation for Montgomery Multiplication in GF(2~m)

摘要

The Montgomery multiplication algorithm without division operations is popular both in prime field GF(p) and Finite field GF(2~m). However, the Montgomery multiplication algorithm has the time-dependent problem. We will present a time-independent Montgomery multiplication algorithm. The results show that our proposed time-independent Montgomery multiplication algorithm not only saves about 50% time complexity but also saves about 11% space complexity as compared to the traditional Montgomery multiplication algorithm. Our proposed systolic array Montgomery multiplier has simplicity, regularity, modularity, and concurrency, and is very suitable for VLSI implementation.