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

Yuko OZASA; Masanori HIROTOMO; Masakatu MORII

doi:10.1587/transfun.E94.A.1045

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Online ISSN : 1745-1337
Print ISSN : 0916-8508

Regular Section

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

Yuko OZASA, Masanori HIROTOMO, Masakatu MORII

Author information

Keywords: finite field, multiplication, polynomial ring representation

JOURNAL RESTRICTED ACCESS

2011 Volume E94.A Issue 3 Pages 1045-1048

DOI https://doi.org/10.1587/transfun.E94.A.1045

Details

Abstract

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(2^m) by the quadrinomial obtained from this irreducible polynomial, its critical delay path is smaller than that of conventional multipliers for some degree m.

Content from these authors

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!