Novel Radix Finite Field Multiplier for GF(2m)

In this paper, a new High-Radix Finite Field multiplication algorithm for GF(2m) is proposed for the first time. The proposed multiplication algorithm can operate in a Digit-serial fashion, and hence can give a trade-off between the speed, the area , the input/output pin limitation, and the low power consumption by simply varying the digit size. A detailed example of a new Radix-16 GF(2m) Digit-Serial multiplication architecture adopting the proposed algorithm illustrates a speed improvement of 75% when compared to conventional Radix-2 bit-serial realization. This is made more significant when it is noted that the speed improvement of 75% was achieved at the expense of only 2.3 times increase in the hardware requirements of the proposed architecture.

[1]  Stafford E. Tavares,et al.  A Fast VLSI Multiplier for GF(2m) , 1986, IEEE J. Sel. Areas Commun..

[2]  S.T.J. Fenn,et al.  Bit-serial dual basis systolic multipliers for GF(2/sup m/) , 1995, Proceedings of ISCAS'95 - International Symposium on Circuits and Systems.

[3]  Mohammed Benaissa,et al.  Bit-serial Berlekamp-like multipliers for GF(2m) , 1995 .

[4]  Vijay K. Bhargava,et al.  Bit-Serial Systolic Divider and Multiplier for Finite Fields GF(2^m) , 1992, IEEE Trans. Computers.

[5]  A. Sengupta,et al.  Algorithms for multiplication in Galois field for implementation using systolic arrays , 1988 .

[6]  Trieu-Kien Truong,et al.  A Comparison of VLSI Architecture of Finite Field Multipliers Using Dual, Normal, or Standard Bases , 1988, IEEE Trans. Computers.

[7]  Trieu-Kien Truong,et al.  Systolic Multipliers for Finite Fields GF(2m) , 1984, IEEE Transactions on Computers.

[8]  Bing Bing Zhou.  A New Bit-Serial Systolic Multiplier Over GF(2m) , 1988, IEEE Trans. Computers.

[9]  Chin-Liang Wang,et al.  Systolic array implementation of multipliers for finite fields GF(2/sup m/) , 1991 .

[10]  Kai Hwang,et al.  Computer arithmetic: Principles, architecture, and design , 1979 .

[11]  Vijay K. Bhargava,et al.  Division and bit-serial multiplication over GF(qm) , 1992 .

[12]  Cheng-Wen Wu,et al.  Bit-level systolic arrays for finite-field multiplications , 1995, J. VLSI Signal Process..

[13]  Keshab K. Parhi,et al.  Low latency standard basis GF(2/sup m/) multiplier and squarer architectures , 1995, 1995 International Conference on Acoustics, Speech, and Signal Processing.

[14]  W. W. Peterson,et al.  Error-Correcting Codes. , 1962 .

[15]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[16]  Masao Kasahara,et al.  Efficient bit-serial multiplication and the discrete-time Wiener-Hopf equation over finite fields , 1989, IEEE Trans. Inf. Theory.

[17]  Mohammed Benaissa,et al.  GF(2^m) Multiplication and Division Over the Dual Basis , 1996, IEEE Trans. Computers.