This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases
November 1998 (vol. 47 no. 11)
pp. 1223-1234

Abstract—New structures of bit-parallel weakly dual basis (WDB) multipliers over the binary ground field are proposed. An upper bound on the size complexity of bit-parallel multiplier using an arbitrary generating polynomial is given. When the generating polynomial is an irreducible trinomial xm + xk + 1, $1\le k\le \left\lfloor {{{m \over 2}}} \right\rfloor,$ the structure of the proposed bit-parallel multiplier requires only m2 two-input AND gates and at most m2$-$1 XOR gates. The time delay is no greater than $T_A + (\lceil \log_2 m\rceil + 2)T_X,$ where TA and TX are the time delays of an AND gate and an XOR gate, respectively.

[1] H. Wu, M.A. Hasan, and I.F. Blake, "Low Complexity Bit-Parallel Finite Field Multipliers," Proc. Fifth Canadian Workshop Information Theory, pp. 109-112,Toronto, Ontario, June3-6 1997.
[2] R. Lidl and H. Niederreiter, Finite Fields.Reading, Mass.: Addison-Wesley, 1983.
[3] I.S. Hsu,T.K. Truong,L.J. Deutsch, and I.S. Reed,"A Comparison of VLSI Architectures of Finite Field Multipliers Using Dual, Normal or Standard Bases," IEEE Trans. Computers, vol. 37, no. 6, pp. 735-737, June 1988.
[4] T.C. Bartee and D.I. Schneider, "Computation with Finite Fields," Information and Computing, vol. 6, pp. 79-98, Mar. 1963.
[5] E.R. Berlekamp, Algebraic Coding Theory.New York: McGraw-Hill, 1968.
[6] B.A. Laws and C.K. Rushforth, "A Cellular-Array Multiplier for GF(2m)," IEEE Trans. Computers, vol. 20, no. 12, pp. 1,573-1,578, Dec. 1971.
[7] C.S. Yeh, I.S. Reed, and T.K. Truong, "Systolic Multipliers for Finite Fields GF(2m)," IEEE Trans. Computers, vol. 33, no. 4, pp. 357-360, Apr. 1984.
[8] P.A. Scott,S.E. Tavares, and L.E. Peppard,"A Fast VLSI Multiplier forGF(2m)," IEEE J. Selected Areas of Comm., vol. 4, pp. 62-66, Jan. 1986.
[9] E.D. Mastrovito, "VLSI Architectures for Computations in Galois Fields," PhD dissertation, Linköping Univ., Linköping, Sweden, 1991.
[10] T. Itoh and S. Tsujii, “Structure of Parallel Multipliers for a Class of Finite Fields$GF(2^m)$,” Information and Computation, vol. 83, pp. 21-40, 1989.
[11] M.A. Hasan, M. Wang, and V.K. Bhargava, Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields$GF(2^m)$ IEEE Trans. Computers, vol. 41, no. 8, pp. 962-971, Aug. 1992.
[12] C. Paar, "Efficient VLSI Architectures for Bit-parallel Computation in Galois Fields," PhD dissertation, Informatik Kommunikationstechnik, VDI-Verlag, Düsseldorf, 1994.
[13] J.L. Massey and J.K. Omura, "Computational Method and Apparatus for Finite Field Arithmetic," U.S. patent no. 4,587,627, 1986.
[14] M.A. Hasan, M.Z. Wang, and V.K. Bhargava, “A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields,” IEEE Trans. Computers, vol. 42, no. 10, pp. 1278-1280, Oct. 1993.
[15] E.R. Berlekamp,"Bit-Serial Reed-Solomon Encoders," IEEE Trans. Information Theory, vol. 28, pp. 869-874, Nov. 1982.
[16] 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.
[17] M. Wang and I.F. Blake,"Bit-Serial Multiplication in Finite Fields," SIAM J. Discrete Maths., vol. 3, pp. 140-148, Feb. 1990.
[18] C.C. Wang, "An Algorithm to Design Finite Field Multipliers Using a Self-Dual Normal Basis," IEEE Trans. Computers, vol. 38, no. 10, pp. 1,457-1,459, Oct. 1989.
[19] 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.
[20] W. Geiselmann and D. Gollmann, "Self-Dual Bases in${\schmi{\bf F}}_{q^n},$" Designs, Codes, and Cryptography, vol. 3, pp. 333-345, 1993.
[21] I.F. Blake, S. Gao, and R. Lambert, "Constructive Problems for Irreducible Polynomials Over Finite Fields," Proc. Canadian Workshop Information Theory, pp. 1-23, 1993.
[22] S.D. Cohen, "On Irreducible Polynomials of Certain Types in Finite Fields," Proc. Cambridge Philosophical Soc., vol. 66, pp. 335-344, 1969.
[23] H. Wu and M.A. Hasan, "Low Complexity Bit-parallel Multipliers for a Class of Finite Fields," IEEE Trans. Computers, vol. 47, no. 8, pp. 883-887, Aug. 1998.

Index Terms:
Bit-parallel multiplier, finite field arithmetic, irreducible polynomials, trinomials, weakly dual basis.
Citation:
Huapeng Wu, M. Anwarul Hasan, Ian F. Blake, "New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases," IEEE Transactions on Computers, vol. 47, no. 11, pp. 1223-1234, Nov. 1998, doi:10.1109/12.736433
Usage of this product signifies your acceptance of the Terms of Use.