GF(q^n)상의 병렬 승산기 설계를 위한 기약다항식에 관한 연구

초록

In this paper present a low complexity parallel canonical basis multiplier for GF(q^n) ,(P 〉2). mastrovito multiplier is investigated and applied to multiplication in GF(q^n) . GF(q^n) is different with GF(2^n), when MVL is applied to finite field. If P is larger than 2, inverse should be considered. Optimized irreducible polynomial can reduce number of operation. In this paper we describe a method for choosing optimized irreducible polynomial and modularizing recursive polynomial operation. A optimized irreducible polynomial is provided which perform modulo reduction with low complexity. As a result, multiplier for fields GF(q^n) with low gate counts and low delays are constructed. The architectures are highly modular and thus well suited for VLSI implementation.