Low Space Complexity Bit Parallel Multiplier For Irreducible Trinomial over GF($2^n$)

The efficient hardware design of finite field multiplication is an very important research topic for and efficient implementation of cryptosystem based on arithmetic in finite field GF(). We used special generating trinomial to construct a bit-parallel multiplier over finite field with low space complexity. To reduce processing time, The hardware architecture of proposed multiplier is similar with existing Mastrovito multiplier. The complexity of proposed multiplier is depend on the degree of intermediate term and the space complexity of the new multiplier is lower than existing multiplier's. The time complexity of the proposed multiplier is equal to that of existing multiplier or increased to ) but space complexity is reduced to maximum 25%.