GF(Pnm)상의 다항식 분할에 의한 병렬 승산기 설계

초록

In this paper proposes a new bit-parallel structure for a multiplier over GF((Pn)m), with k=nm. Mastrovito Multiplier, Karatsuba-ofman algorithm are applied to the multiplication of polynomials over FG(2n). This operation has a complexity of oredr O(klogp3) under certain constrains regarding k. Acomplete set of primitive field polynomials for composite fields is provided which perform modulo reduction with low complexity. As a result, multiplier for fields GF(Pk) with low gate counts and low delays are constructed. The architectures are highly modular and thus well suited for VLSI implementation