By Topic

Low complexity bit-parallel multipliers for GF(2m) with generator polynomial xm+xk+1

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 $31
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

3 Author(s)
Elia, M. ; Dipt. di Elettronica, Politecnico di Torino, Italy ; Leone, M. ; Visentin, C.

A low complexity bit-parallel standard basis multiplier for GF(2 m) with polynomial generator xm+xk+1 is presented. The proposed multiplier uses a significantly smaller number of XOR/AND gates than the fastest known multipliers, while having a comparable logarithmic computing time

Published in:

Electronics Letters  (Volume:35 ,  Issue: 7 )