VLSI implementation of public-key encryption algorithms
Proceedings on Advances in cryptology---CRYPTO '86
Constructing normal bases in finite fields
Journal of Symbolic Computation
Implementation of Elliptic Curve Cryptographic Coprocessor over GF(2m) on an FPGA
CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
Architecture for VLSI Design of Reed-Solomon Decoders
IEEE Transactions on Computers
A Theory of Galois Switching Functions
IEEE Transactions on Computers
Systolic Multipliers for Finite Fields GF(2m)
IEEE Transactions on Computers
Programmable Array Realizations of Synchronous Sequential Machines
IEEE Transactions on Computers
Galois field hardware architectures for network coding
Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Efficient semisystolic architectures for finite-field arithmetic
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 15.00 |
This note describes a cellular array that computes the product of two arbitrary elements of the Galois field GF(2m). The regularity of this array should make it attractive for LSI fabrication.