Double-Basis Multiplicative Inversion Over GF(2m)

@article{Hasan1998DoubleBasisMI,
  title={Double-Basis Multiplicative Inversion Over GF(2m)},
  author={M. Anwar Hasan},
  journal={IEEE Trans. Computers},
  year={1998},
  volume={47},
  pages={960-970}
}
Inversion over Galois fields is much more difficult than the corresponding multiplication. In this article, efficient computation of inverses in GF(2 m ) 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. 
Highly Cited
This paper has 36 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Fast Inverter Over Finite Field Based on Euclid’s Algorithm

  • K. Araki, I. Fujita, M. Morisue
  • Trans. Inst. Electronics, Information, and Comm…
  • 1989
Highly Influential
4 Excerpts

Double-Basis Inversion in GF(2 m )

  • M. A. Hasan
  • Proc. Canadian Conf. Electrical and Computer Eng…
  • 1995

Algorithms and Architectures for the Design of a VLSI Reed-Solomon Codec

  • M. A. Hasan, V. K. Bhargava, T. Le-Ngoc
  • Reed-Solomon Codes and Their Applications, S.B…
  • 1994
1 Excerpt