Issue No. 05 - May (1997 vol. 46)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.589230
<p><b>Abstract</b>—The circuit complexity of a Massey-Omura normal basis multiplier for a finite field <it>GF</it>(2<super><it>m</it></super>) depends on the key function for multiplication. Key functions with minimum complexity, called minimal key functions, are desirable. This paper investigates the complexity of a key function and reports search results of minimal key functions. A table of minimal key functions for <it>m</it> up to 31 is included.</p>
Finite field, normal basis, multiplier, coding, cryptography.
C. Lu, "A Search of Minimal Key Functions for Normal Basis Multipliers," in IEEE Transactions on Computers, vol. 46, no. , pp. 588-592, 1997.