High-Throughput Low-Complexity Systolic Montgomery Multiplication Over $GF(2^{m})$ Based on Trinomials
Siavash Bayat-Sarmadi, Mohammad Farmani · IEEE Transactions on Circuits & Systems II Express Briefs · 2015
Cryptographic computation exploits finite field arithmetic and, in particular, multiplication. Lightweight and fast implementations of such arithmetic are necessary for many sensitive applications. This brief 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 with the previous work. This has also been confirmed through our application-specific integrated circuit area and time equivalent estimations and implementations. Hence, the proposed architecture appears to be very well suited for high-throughput low-complexity cryptographic applications.