Reduced complexity polynomial multiplier architecture for finite fields GF(2^m)

Abstract

This letter presents a low-complexity semi-systolic array imple- mentation for polynomial multiplication over GF(2^m). We consider finite field Montgomery modular multiplication (MMM) based on two-level para- llel computing approach to reduce the cell delay, latency, and area-time (AT) complexity. Compared to related multipliers, the proposed scheme yields significantly lower AT complexity.