Computing in the composite GF (qm) of characteristic 2 formed by means of an irreducible binomial
Cz. Kościelny · Digital library of Zielona Gora (University of Zielona Góra) · 1998
Since the operation of reduction modulo a polynomial needed for parallel computing in GF(qm) is the simplest possible in the case of a binomial, in this paper the main properties of irreducible binomials over GF(q) of characteris- tic 2 are given.It is shown that PThe method of performing all mul- tiplicative operations in GF(qm) of characteristic 2 (multiplication, rising to an arbitrary power, multiplicative inversion) formed by means of an irreducible polynomial is also presented.The use of irreducible binomials may be attractive for those engineers and researches who deal with implementation of hardware and microprogrammed devices for computing in GF(qm), even if m and q are large.