VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
IEEE Transactions on Computers
Cryptography and data security
Cryptography and data security
Error Control Coding, Second Edition
Error Control Coding, Second Edition
Fast Normal Basis Multiplication Using General Purpose Processors
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
On Efficient Normal Basis Multiplication
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Efficient Multiplication Beyond Optimal Normal Bases
IEEE Transactions on Computers
Hardware architectures for public key cryptography
Integration, the VLSI Journal
Fast Normal Basis Multiplication Using General Purpose Processors
IEEE Transactions on Computers
Low Complexity Word-Level Sequential Normal Basis Multipliers
IEEE Transactions on Computers
Efficient Algorithms and Architectures for Field Multiplication Using Gaussian Normal Bases
IEEE Transactions on Computers
Concurrent error detection architectures for Gaussian normal basis multiplication over GF(2m)
Integration, the VLSI Journal
Journal of Signal Processing Systems
| Hi-index | 14.99 |
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.