VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
IEEE Transactions on Computers
An algorithm for solving discrete-time Wiener-Hopf equations based upon Euclid's algorithm
IEEE Transactions on Information Theory
Bit serial multiplication in finite fields
SIAM Journal on Discrete Mathematics
Bit-Serial Systolic Divider and Multiplier for Finite Fields GF(2/sup m/)
IEEE Transactions on Computers - Special issue on computer arithmetic
Division-and-Accumulation over GF(2m)
IEEE Transactions on Computers
Digital Communications and Spread Spectrum System
Digital Communications and Spread Spectrum System
On Computing Multiplicative Inverses in GF(2/sup m/)
IEEE Transactions on Computers
Architecture For A Low Complexity Rate-Adaptive Reed-Solomon Encoder
IEEE Transactions on Computers
GF(2m) Multiplication and Division Over the Dual Basis
IEEE Transactions on Computers
Division-and-Accumulation over GF(2m)
IEEE Transactions on Computers
On the Inherent Space Complexity of Fast Parallel Multipliers for GF(2/supm/)
IEEE Transactions on Computers
New Systolic Architectures for Inversion and Division in GF(2^m)
IEEE Transactions on Computers
High-Speed, Low-Complexity Systolic Designs of Novel Iterative Division Algorithms in GF(2^m)
IEEE Transactions on Computers
IEEE Transactions on Computers
IEEE Transactions on Computers
Bit-Parallel Finite Field Multipliers for Irreducible Trinomials
IEEE Transactions on Computers
Journal of VLSI Signal Processing Systems
| Hi-index | 15.00 |
Inversion over Galois fields is much more difficult than the corresponding multiplication. In this article, efficient computation of inverses in GF(2m) is considered by solving a set of linear equations over the ground field GF(2). The proposed algorithm uses two separate bases for the representation of its input and output elements and has low computational complexity. The algorithm is also suitable for hardware implementation using VLSI technologies.