Low complexity normal bases

Abstract

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… (More)
DOI: 10.1016/0166-218X(89)90001-2

Topics

2 Figures and Tables

Statistics

051015'92'95'98'01'04'07'10'13'16
Citations per Year

118 Citations

Semantic Scholar estimates that this publication has 118 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Ash1989LowCN, title={Low complexity normal bases}, author={David W. Ash and Ian F. Blake and Scott A. Vanstone}, journal={Discrete Applied Mathematics}, year={1989}, volume={25}, pages={191-210} }