Parallel GF(3(m)) multiplier for trinomials
In this paper, we propose a parallel multiplier over arbitrary finite field GF(p(m)). In particular, we apply the proposed multiplier to GF(3(m)) defined by irreducible trinomial which has received a great interest recently. The proposed GF(3(m)) multiplier is not only the first parallel multiplier with explicit complexities, but its complexities also match with generalized forms of the complexities of the most efficient GF(2(m)) multiplier. (C) 2012 Elsevier B.V. All rights reserved.
trinomial parallel multiplier finite field arithmetic characteristic three cryptography