High Throughput Low Complexity Systolic Montgomery

Cryptographic computation exploits finite field arithmetic and in particular the multiplication. Lightweight and fast implementations of such arithmetic are necessary for many sensitive applications. This paper proposed a low-complexity systolic Montgomery multiplication over GF(2m). Our complexity analysis shows that the area complexity of the proposed architecture is reduced compared to the previous work.

This has also been confirmed through our application-specific integrated circuit (ASIC) area and time equivalent estimations and implementations. Hence, the proposed architecture appears to be very well suited for high-throughput low-complexity cryptographic applications.