An Algorithm to Design Finite Field Multipliers Using a Self-Dual Normal Basis
IEEE Transactions on Computers
Low Complexity Soft-Decision Sequential Decoding Using Hybrid Permutation for Reed-Solomon Codes
Proceedings of the 7th IMA International Conference on Cryptography and Coding
On efficient implementation of accumulation in finite field over GF(2m) and its applications
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 754.84 |
Massey and Omura recently developed a new multiplication algorithm for Galois fields based on the normal basis representation. This algorithm shows a much simpler way to perform multiplication in finite field than the conventional method. The necessary and sufficient conditions are presented for an element to generate a normal basis in the field GF(2^{m}), wherem = 2^{k}p^{n}andp^{n}has two as a primitive root. This result provides a way to find a normal basis in the field.