Compact Bit-Parallel Systolic Montgomery Multiplication Over GF(2m) Generated by Trinomials

This paper presents a scalable and systolic Montgomery´s algorithm in GF(2^m) using the Hankel matrix-vector representation. The hardware architectures derived from this algorithm represents low-complexity bit-parallel systolic multipliers with trinomials. The results reveal that our proposed multiplier saves approximately 36% space complexity as compared to an existing systolic Montgomery multiplier for trinomials. Moreover, the proposed architectures have the features of regularity, modularity, and local interconnect ability. Accordingly, they are well suited for VLSI implementation