A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Low complexity normal bases
1989
Discrete Applied Mathematics
A normal basis in GF(qm) is a basis of the form {a p9, fig', . . . , flqm-'], i.e., a basis of conjugate elements in the field. In GF(2'") squaring with respect to a normal basis representation becomes simply a cyclic shift of the vector. For hardware design this is one of the very attractive features of these bases. Multiplication with respect to a normal basis can be defined in terms of a certain bilinear form. Define the complexity of the normal basis to be the number of nonzero terms in
doi:10.1016/0166-218x(89)90001-2
fatcat:i44sqckagbdgtays6mnjiz2t24