Title :
A search of minimal key functions for normal basis multipliers
Author_Institution :
Dept. of Electr. Eng., Nat. Tsing Hua Univ., Hsinchu, Taiwan
fDate :
5/1/1997 12:00:00 AM
Abstract :
The circuit complexity of a Massey-Omura normal basis multiplier for a finite field GF(2m) 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
Keywords :
cryptography; digital arithmetic; logic design; Massey-Omura normal basis multiplier; circuit complexity; coding; cryptography; finite field; minimal key functions; multiplier; normal basis; normal basis multipliers; Arithmetic; Circuits; Codecs; Complexity theory; Cryptography; Galois fields; Programmable logic arrays; Propagation delay; Shift registers; Very large scale integration;
Journal_Title :
Computers, IEEE Transactions on
