By Topic

Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Koc, C.K. ; Dept. of Electr. & Comput. Eng., Oregon State Univ., Corvallis, OR, USA ; Sunar, B.

We present a new low-complexity bit-parallel canonical basis multiplier for the field GF(2m) generated by an all-one-polynomial. The proposed canonical basis multiplier requires m2-1 XOR gates and m2 AND gates. We also extend this canonical basis multiplier to obtain a new bit-parallel normal basis multiplier

Published in:

Computers, IEEE Transactions on  (Volume:47 ,  Issue: 3 )