© The Institution of Engineering and Technology
A new architecture of multipliers for GF(2m) which accomplishes multiplication by lower-dimensional multiplication is proposed. The space complexity of the new multipliers is about 1/2 (1+1/r) of the ordinary ones, and it only needs two or three more XOR gate delays.
References
-
-
1)
-
H. Wu
.
Bit-parallel polynomial basis multiplier for new classes of finite fields.
IEEE Trans. Comput.
,
8 ,
1023 -
1031
-
2)
-
S.A. Vanstone ,
P.C. Oorschot
.
(1989)
An introduction to error correcting codes with applications.
-
3)
-
Z. Mao ,
G. Shou ,
Y. Hu ,
Z. Gang
.
Design of multipliers on GF(2m).
Electron. Lett.
,
6 ,
419 -
420
-
4)
-
J.L. Imaňa ,
J.M. Sanchez ,
F. Tirado
.
Bit-parallel finite field multipliers for irreducible trinomials.
IEEE Trans. Comput.
,
5 ,
520 -
533
-
5)
-
R. Lidl ,
H. Niederreiter
.
(1994)
Introduction to finite fields and their applications.
-
6)
-
A. Reyhani-Masoleh ,
A. Hasan
.
Low complexity bit parallel architecture for polynomial basis multiplication over GF (2m).
IEEE Trans. Comput.
,
8 ,
945 -
959
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2010.1710
Related content
content/journals/10.1049/el.2010.1710
pub_keyword,iet_inspecKeyword,pub_concept
6
6