Proceedings of the IEEK Conference (대한전자공학회:학술대회논문집)
- 1998.10a
- /
- Pages.771-774
- /
- 1998
A Parallel Multiplier By Mutidigit Numbers Over GF($P^{nm}$ )
GF($P^{nm}$ )상의 다항식 분할에 의한 병렬 승산기 설계
Abstract
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 GF(2n). This operation has a complexity of order O(k log p3) under certain constrains regardig k. A complete 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.
Keywords