
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Huapeng Wu, M. Anwarul Hasan, Ian F. Blake, "New LowComplexity BitParallel Finite Field Multipliers Using Weakly Dual Bases," IEEE Transactions on Computers, vol. 47, no. 11, pp. 12231234, November, 1998.  
BibTex  x  
@article{ 10.1109/12.736433, author = {Huapeng Wu and M. Anwarul Hasan and Ian F. Blake}, title = {New LowComplexity BitParallel Finite Field Multipliers Using Weakly Dual Bases}, journal ={IEEE Transactions on Computers}, volume = {47}, number = {11}, issn = {00189340}, year = {1998}, pages = {12231234}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.736433}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  New LowComplexity BitParallel Finite Field Multipliers Using Weakly Dual Bases IS  11 SN  00189340 SP1223 EP1234 EPD  12231234 A1  Huapeng Wu, A1  M. Anwarul Hasan, A1  Ian F. Blake, PY  1998 KW  Bitparallel multiplier KW  finite field arithmetic KW  irreducible polynomials KW  trinomials KW  weakly dual basis. VL  47 JA  IEEE Transactions on Computers ER   
Abstract—New structures of bitparallel weakly dual basis (
[1] H. Wu, M.A. Hasan, and I.F. Blake, "Low Complexity BitParallel Finite Field Multipliers," Proc. Fifth Canadian Workshop Information Theory, pp. 109112,Toronto, Ontario, June36 1997.
[2] R. Lidl and H. Niederreiter, Finite Fields.Reading, Mass.: AddisonWesley, 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. 735737, June 1988.
[4] T.C. Bartee and D.I. Schneider, "Computation with Finite Fields," Information and Computing, vol. 6, pp. 7998, Mar. 1963.
[5] E.R. Berlekamp, Algebraic Coding Theory.New York: McGrawHill, 1968.
[6] B.A. Laws and C.K. Rushforth, "A CellularArray Multiplier for GF(2m)," IEEE Trans. Computers, vol. 20, no. 12, pp. 1,5731,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. 357360, 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. 6266, 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. 2140, 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. 962971, Aug. 1992.
[12] C. Paar, "Efficient VLSI Architectures for Bitparallel Computation in Galois Fields," PhD dissertation, Informatik Kommunikationstechnik, VDIVerlag, 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 MasseyOmura Parallel Multiplier for a Class of Finite Fields,” IEEE Trans. Computers, vol. 42, no. 10, pp. 12781280, Oct. 1993.
[15] E.R. Berlekamp,"BitSerial ReedSolomon Encoders," IEEE Trans. Information Theory, vol. 28, pp. 869874, Nov. 1982.
[16] M. Morii,M. Kasahara, and D.L. Whiting,"Efficient BitSerial Multiplication and the DiscreteTime WienerHopft Equation over Finite Fields," IEEE Trans. Information Theory, vol. 35, pp. 1,1771,183, Nov. 1989.
[17] M. Wang and I.F. Blake,"BitSerial Multiplication in Finite Fields," SIAM J. Discrete Maths., vol. 3, pp. 140148, Feb. 1990.
[18] C.C. Wang, "An Algorithm to Design Finite Field Multipliers Using a SelfDual Normal Basis," IEEE Trans. Computers, vol. 38, no. 10, pp. 1,4571,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. 319327, Mar. 1996.
[20] W. Geiselmann and D. Gollmann, "SelfDual Bases in${\schmi{\bf F}}_{q^n},$" Designs, Codes, and Cryptography, vol. 3, pp. 333345, 1993.
[21] I.F. Blake, S. Gao, and R. Lambert, "Constructive Problems for Irreducible Polynomials Over Finite Fields," Proc. Canadian Workshop Information Theory, pp. 123, 1993.
[22] S.D. Cohen, "On Irreducible Polynomials of Certain Types in Finite Fields," Proc. Cambridge Philosophical Soc., vol. 66, pp. 335344, 1969.
[23] H. Wu and M.A. Hasan, "Low Complexity Bitparallel Multipliers for a Class of Finite Fields," IEEE Trans. Computers, vol. 47, no. 8, pp. 883887, Aug. 1998.