Logo image
Back
A search of minimal key functions for normal basis multipliers
Journal article   Peer reviewed

A search of minimal key functions for normal basis multipliers

Chung-Chin Lu
IEEE Transactions on Computers, Vol.46(5), pp.588-592
1997
DOI: https://doi.org/10.1109/12.589230

Abstract

Coding Cryptography Finite field Multiplier Normal basis
The circuit complexity of a Massey-Omura normal basis multiplier for a finite field GF(2 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. © 1997 IEEE.

Metrics

1 Record Views

Details

Logo image