Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
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
Czasopismo
Rocznik
Tom
Strony
671--680
Opis fizyczny
Bibliogr. 4 poz., tab.
Twórcy
autor
- Technical University of Zielona Góra, Departament of Robotics and Software Engineering, ul. Podgórna 50, 65-246 Zielona Góra, Poland
Bibliografia
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BPZ1-0021-0038