The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1997 vol.46)
pp: 588-592
ABSTRACT
<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>
INDEX TERMS
Finite field, normal basis, multiplier, coding, cryptography.
CITATION
Chung-Chin Lu, "A Search of Minimal Key Functions for Normal Basis Multipliers", IEEE Transactions on Computers, vol.46, no. 5, pp. 588-592, May 1997, doi:10.1109/12.589230
31 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool