Publication 1998 Issue No. 9 - September Abstract - Double-Basis Multiplicative Inversion Over GF(2m)
Double-Basis Multiplicative Inversion Over GF(2m)
September 1998 (vol. 47 no. 9)
pp. 960-970
 ASCII Text x M. Anwarul Hasan, "Double-Basis Multiplicative Inversion Over GF(2m)," IEEE Transactions on Computers, vol. 47, no. 9, pp. 960-970, September, 1998.
 BibTex x @article{ 10.1109/12.713315,author = {M. Anwarul Hasan},title = {Double-Basis Multiplicative Inversion Over GF(2m)},journal ={IEEE Transactions on Computers},volume = {47},number = {9},issn = {0018-9340},year = {1998},pages = {960-970},doi = {http://doi.ieeecomputersociety.org/10.1109/12.713315},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on ComputersTI - Double-Basis Multiplicative Inversion Over GF(2m)IS - 9SN - 0018-9340SP960EP970EPD - 960-970A1 - M. Anwarul Hasan, PY - 1998KW - Computer arithmeticKW - Euclid's algorithmKW - Galois (or finite) fieldsKW - multiplicative inversesKW - canonical (or polynomial) basis and triangular basis.VL - 47JA - IEEE Transactions on ComputersER -

Abstract—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.

[1] M.A. Hasan, "Double-Basis Inversion in GF(2m)," Proc. 1995 Canadian Conf. Electrical and Computer Eng., pp. 229-232, 1995.
[2] W. Diffie and M.E. Hellman, New Directions in Cryptography IEEE Trans. Information Theory, vol. 22, pp. 644-654, 1976.
[3] G.B. Agnew, R.C. Mullin, and S.A. Vanstone, An Implementation of Elliptic Curve Cryptosystems over$F_{2^{155}}$ IEEE J. Selected Areas in Comm., vol. 11, no. 5, pp. 804-813, June 1993.
[4] M.A. Hasan, V.K. Bhargava, and T. Le-Ngoc, "Algorithms and Architectures for the Design of a VLSI Reed-Solomon Codec," Reed-Solomon Codes and Their Applications, S.B. Wicker and V.K. Bhargava, eds., chapter 4, pp. 60-107. IEEE Press, June 1994.
[5] C.C. Wang,T.K. Truong,H.M. Shao,L.J. Deutsch,J.K. Omura, and I.S. Reed,"VLSI Architectures for Computing Multiplications and Inverses inGF(2m)," IEEE Trans. Computers, vol. 34, no. 8, pp. 709-716, Aug. 1985.
[6] K. Araki, I. Fujita, and M. Morisue, "Fast Inverter Over Finite Field Based on Euclid's Algorithm," Trans. Inst. Electronics, Information, and Comm. Engineers, vol. E-72, pp. 1,230-1,234, Nov. 1989.
[7] M.A. Hasan and V.K. Bhargava,"Bit-Serial Systolic Divider and Multiplier for Finite FieldsGF(2m)," IEEE Trans. Computers, vol. 41, no. 8, pp. 972-980, Aug. 1992.
[8] M.A. Hasan and V.K. Bhargava,"Division and Bit-Serial Multiplication overGF(qm)," IEE Proc. E., vol. 139, pp. 230-236, May 1992.
[9] C. Paar, Some Remarks on Efficient Inversion in Finite Fields Proc. 1995 Int'l Symp. Information Theory, 1995.
[10] E.R. Berlekamp,"Bit-Serial Reed-Solomon Encoders," IEEE Trans. Information Theory, vol. 28, pp. 869-874, Nov. 1982.
[11] M. Morii,M. Kasahara, and D.L. Whiting,"Efficient Bit-Serial Multiplication and the Discrete-Time Wiener-Hopft Equation over Finite Fields," IEEE Trans. Information Theory, vol. 35, pp. 1,177-1,183, Nov. 1989.
[12] M. Wang and I.F. Blake,"Bit-Serial Multiplication in Finite Fields," SIAM J. Discrete Maths., vol. 3, pp. 140-148, Feb. 1990.
[13] M.A. Hasan and V.K. Bhargava, "Architecture for a Low Complexity Rate-Adaptive Reed-Solomon Encoder," IEEE Trans. Computers, vol. 44, no. 7, pp. 938-942, July 1995.
[14] Y. Sugiyama, "An Algorithm for Solving Discrete Time Wiener-Hopf Equations Based on Euclid's Algorithm," IEEE Trans. Information Theory, vol. 32, pp. 394-409, May 1986.
[15] R.P. Brent and H.T. Kung, "Systolic VLSI Arrays for Polynomial GCD Computation," IEEE Trans. Computers, vol. 33, no. 8, pp. 731-736, Aug. 1984.
[16] H. Brunner, A. Curiger, and M. Hofstetter, On Computing Multiplicative Inverses in${\rm GF}(2^m)$ IEEE Trans. Computers, vol. 42, no. 8, pp. 1010-1015, Aug. 1993.
[17] S.T.J. Fenn, M. Benaissa, and D. Taylor, $GF(2^m)$Multiplication and Division over the Dual Basis IEEE Trans. Computers, vol. 45, no. 3, pp. 319-327, Mar. 1996.
[18] M.A. Hasan, "Division-and-Accumulation over GF(2m)," IEEE Trans. Computers, vol. 46, no. 6, pp. 705-708, June 1997.
[19] R E. Ziemer and R.L. Peterson, Digital Communications and Spread Spectrum Systems.New York: Macmillan, 1985.

Index Terms:
Computer arithmetic, Euclid's algorithm, Galois (or finite) fields, multiplicative inverses, canonical (or polynomial) basis and triangular basis.
Citation:
M. Anwarul Hasan, "Double-Basis Multiplicative Inversion Over GF(2m)," IEEE Transactions on Computers, vol. 47, no. 9, pp. 960-970, Sept. 1998, doi:10.1109/12.713315