GF(3^m)상에서 모든 항의 계수가 존재하는 기약다항식의 승산기 설계

초록

In this paper, we proposed a multiplicative algorithm for two polynominals in existence coefficients over finite field GF(3^m). Using the proposed multiplicative algorithm, we constructed the multiplier of modular architecture with parallel in-output. The proposed multiplier is composed of (m+1)^2 identical cells, each cell consists of single mod(3) additional gate and single mod(3) multiplicative gate. Proposed multiplier need single mod(3) multiplicative gate delay time and m mod(3) additional gate delay time not clock. Also, the proposed architecture is simple, regular and has the property of modularity, therefore well-suited for VLSI implementation.