A search of minimal key functions for normal basis multipliers
Chung-Chin Lu · IEEE Transactions on Computers · 1997
The circuit complexity of a Massey-Omura normal basis multiplier for a finite field GF(2/sup m/) 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 m up to 31 is included.