Irreducible m-Term Polynomial and Its Application to Multiplication over GF(2m)

Yuko OZASA  Masanori HIROTOMO  Masakatu MORII  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E94-A   No.3   pp.1045-1048
Publication Date: 2011/03/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E94.A.1045
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: General Fundamentals and Boundaries
Keyword: 
finite field,  multiplication,  polynomial ring representation,  

Full Text: PDF(85.4KB)
>>Buy this Article


Summary: 
In this paper, we present a specific type of irreducible polynomial which is an irreducible m-term polynomial of degree m. Designing the parallel multiplier over GF(2m) by the quadrinomial obtained from this irreducible polynomial, its critical delay path is smaller than that of conventional multipliers for some degree m.