LOW-COMPLEXITY BIT-PARALLEL CANONICAL AND NORMAL BASIS MULTIPLIERS FOR A CLASS OF FINITE-FIELDS

Authors
KOC CK SUNAR B
Citation
Ck. Koc et B. Sunar, LOW-COMPLEXITY BIT-PARALLEL CANONICAL AND NORMAL BASIS MULTIPLIERS FOR A CLASS OF FINITE-FIELDS, I.E.E.E. transactions on computers, 47(3), 1998, pp. 353-356
Citations number
9
Categorie Soggetti
Computer Science Hardware & Architecture","Engineering, Eletrical & Electronic","Computer Science Hardware & Architecture
Journal title
I.E.E.E. transactions on computers → ACNP
ISSN journal
00189340
Volume
47
Issue
3
Year of publication
1998
Pages
353 - 356
Database
ISI
SICI code
0018-9340(1998)47:3<353:LBCANB>2.0.ZU;2-1
Abstract
We present a new low-complexity bit-parallel canonical basis multiplie r for the field GF(2(m)) generated by an all-one-polynomial. The propo sed canonical basis multiplier requires m(2) - 1 XOR gates and m(2) AN D gates. We also extend this canonical basis multiplier to obtain a ne w bit-parallel normal basis multiplier.