
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Jos? Luis Ima?, Juan Manuel S?nchez, Francisco Tirado, "BitParallel Finite Field Multipliers for Irreducible Trinomials," IEEE Transactions on Computers, vol. 55, no. 5, pp. 520533, May, 2006.  
BibTex  x  
@article{ 10.1109/TC.2006.69, author = {Jos? Luis Ima? and Juan Manuel S?nchez and Francisco Tirado}, title = {BitParallel Finite Field Multipliers for Irreducible Trinomials}, journal ={IEEE Transactions on Computers}, volume = {55}, number = {5}, issn = {00189340}, year = {2006}, pages = {520533}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2006.69}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  BitParallel Finite Field Multipliers for Irreducible Trinomials IS  5 SN  00189340 SP520 EP533 EPD  520533 A1  Jos? Luis Ima?, A1  Juan Manuel S?nchez, A1  Francisco Tirado, PY  2006 KW  Finite (or Galois) fields KW  multiplication KW  canonical basis KW  irreducible trinomials KW  complexity KW  triangular basis KW  matrix decomposition KW  permutation KW  cycles KW  transpositions. VL  55 JA  IEEE Transactions on Computers ER   
[1] 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.
[2] A. Halbutogullari and Ç.K. Koç, “Mastrovito Multiplier for General Irreducible Polynomials,” Applied Algebra, Algebraic Algorithms, and ErrorCorrecting Codes, pp. 498507, 1999.
[3] A. Halbutogullari and Ç.K. Koç, “Mastrovito Multiplier for General Irreducible Polynomials,” IEEE Trans. Computers, vol. 49, no. 5, pp. 503518, May 2000.
[4] M.A. Hasan, “DoubleBasis Multiplicative Inversion over $GF(2^m)$ ,” IEEE Trans. Computers, vol. 47, no. 9, pp. 960970, Sept. 1998.
[5] M.A. Hasan and V.K. Bhargava, “Architecture for a Low Complexity RateAdaptive ReedSolomon Encoder,” IEEE Trans. Computers, vol. 44, no. 6, pp. 938942, June 1995.
[6] M.A. Hasan, M.Z. 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.
[7] 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.
[8] J.L. Imaña and J.M. Sánchez, “A New ReconfigurableOriented Method for Canonical Basis Multiplication Over a Class of Finite Fields $GF(2^m)$ ,” Proc. 13th Int'l Conf. Field Programmable Logic and Applications, pp. 11271130, 2003.
[9] 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.
[10] Ç.K. Koç and B. Sunar, “LowComplexity BitParallel Canonical and Normal Basis Multipliers for a Class of Finite Fields,” IEEE Trans. Computers, vol. 47, no. 3, pp. 353356, Mar. 1998.
[11] R. Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications. New York: Cambridge Univ. Press, 1994.
[12] E.D. Mastrovito, “VLSI Architectures for Multiplication over Finite Fields $GF(2^m)$ ,” Proc. Sixth Int'l Conf. Applied Algebra, Algebraic Algorithms, and ErrorCorrecting Codes (AAECC6), pp. 297309, July 1988.
[13] Applications of Finite Fields, A.J. Menezes, ed. Boston: Kluwer Academic, 1993.
[14] J. Omura and J. Massey, “Computational Method and Apparatus for Finite Field Arithmetic,” US Patent Number 4,587,627, May 1986.
[15] K.K. Parhi, VLSI Digital Signal Processing Systems: Design and Implementation. John Wiley & Sons, 1999.
[16] A. ReyhaniMasoleh and M.A. Hasan, “On Low Complexity Bit Parallel Polynomial Basis Multipliers,” Proc. Workshop on Cryptographic Hardware and Embedded Systems (CHES 2003), pp. 189202, 2003.
[17] B. Sunar and Ç.K. Koç, “Mastrovito Multiplier for All Trinomials,” IEEE Trans. Computers, vol. 48, no. 5, pp. 522527, May 1999.
[18] H. Wu, “BitParallel Finite Field Multiplier and Squarer Using Polynomial Basis,” IEEE Trans. Computers, vol. 51, no. 7, pp. 750758, July 2002.
[19] H. Wu and M.A. Hasan, “LowComplexity BitParallel Multipliers for a Class of Finite Fields,” IEEE Trans. Computers, vol. 47, no. 8, pp. 883887, Aug. 1998.
[20] T. Zhang and K.K. Parhi, “Systematic Design of Original and Modified Mastrovito Multipliers for General Irreducible Polynomials,” IEEE Trans. Computers, vol. 50, no. 7, pp. 734749, July 2001.