Computing in the composite GF (qm) of characteristic 2 formed by means of an irreducible binomial

• Autorzy: Kościelny Cz.
• Języki publikacji: EN

Abstrakty

EN

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 characteristic 2 are given. It is shown that P(x) = xm - Po is irreducible over GF(q) for [ ... ] divides q-1. The method of performing all multiplicative 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.

Słowa kluczowe

EN

computing; irreducible binomial

PL

obliczanie; dwumian nie redukujący się

• Wydawca: Oficyna Wydawnicza Uniwersytetu Zielonogórskiego
• Czasopismo: Applied Mathematics and Computer Science
• Rocznik: 1998
• Tom: Vol. 8, no 3
• Strony: 671--680
• Opis fizyczny: Bibliogr. 4 poz., tab.

Twórcy

autor

Kościelny Cz.

• Technical University of Zielona Góra, Departament of Robotics and Software Engineering, ul. Podgórna 50, 65-246 Zielona Góra, Poland