By Topic

On bit-serial multiplication and dual bases in GF(2m)

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

1 Author(s)
Stinson, D.R. ; Dept. of Comput. Sci. & Eng., Nebraska Univ., Lincoln, NE, USA

The existence of certain types of dual bases in finite fields GF(2 m) is discussed. These special types of dual bases are needed for efficient implementation of (generalized) bit-serial multiplication in GF(2m). In particular, the question of choosing a polynomial basis of GF(2m), for example {1, α, α 2, α3, . . ., αm-1}, such that the change of basis matrix from the dual basis to a scalar multiple of the original basis has as few `1' entries as possible, is studied. It was previously shown by M. Wang and I. F. Blake (1990) that the optimal situation occurs when the minimal polynomial of α is an irreducible trinomial of degree m; then, an appropriate scalar multiple, β, yields a change of basis matrix that is a permutation matrix. A construction is presented that often yields bases where the change of basis matrix has low weight, in the case where no irreducible trinomial of degree m exists. A simple formula can be used to compute β and the weight of the change of basis matrix, given the minimal polynomial of α

Published in:

Information Theory, IEEE Transactions on  (Volume:37 ,  Issue: 6 )