
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
A. Halbutogullari, Çetin K. Koç, "Mastrovito Multiplier for General Irreducible Polynomials," IEEE Transactions on Computers, vol. 49, no. 5, pp. 503518, May, 2000.  
BibTex  x  
@article{ 10.1109/12.859542, author = {A. Halbutogullari and Çetin K. Koç}, title = {Mastrovito Multiplier for General Irreducible Polynomials}, journal ={IEEE Transactions on Computers}, volume = {49}, number = {5}, issn = {00189340}, year = {2000}, pages = {503518}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.859542}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Mastrovito Multiplier for General Irreducible Polynomials IS  5 SN  00189340 SP503 EP518 EPD  503518 A1  A. Halbutogullari, A1  Çetin K. Koç, PY  2000 KW  Finite fields KW  multiplication KW  polynomial basis KW  complexity KW  irreducible polynomials. VL  49 JA  IEEE Transactions on Computers ER   
Abstract—We present a new formulation of the Mastrovito multiplication matrix for the field
[1] G. Golub and C. Van Loan, Matrix Computations, third ed. Baltimore: Johns Hopkins Univ. Press, 1996.
[2] A. Halbutogullari and Ç.K. Koç, “Mastrovito Multiplier for General Irreducible Polynomials,” Applied Algebra, Algebraic Algorithms and ErrorCorrecting Codes, pp. 498507, 1999.
[3] 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.
[4] 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.
[5] Ç.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.
[6] R. Lidl and H. Niederreiter,An Introduction to Finite Fields and Their Applications.Cambridge: Cambridge Univ. Press, 1986.
[7] E.D. Mastrovito,"VLSI Design for Multiplication over Finite Fields," LNCS357, Proc. AAECC6, pp. 297309,Rome, July 1988, SpringerVerlag.
[8] E.D. Mastrovito, “VLSI Architectures for Computation in Galois Fields,” PhD thesis, Dept. of Electrical Eng., Linköping Univ., Linköping, Sweden, 1991.
[9] A.J. Menezes, Elliptic Curve Public Key Cryptosystems. Boston: Kluwer Academic, 1993.
[10] A.J. Menezes, I.F. Blake, X. Gao, R.C. Mullen, S.A. Vanstone, and T. Yaghoobian, Applications of Finite Fields. Boston: Kluwer Academic, 1993.
[11] J. Omura and J. Massey, “Computational Method and Apparatus for Finite Field Arithmetic,” U.S. Patent Number 4,587,627, May 1986.
[12] C. Paar, “Efficient VLSI Architectures for Bit Parallel Computation in Galois Fields,” PhDthesis, Universität GH Essen, VDI Verlag, 1994.
[13] C. Paar, “A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields,” IEEE Trans. Computers, vol. 45, no. 7, pp. 846861, July 1996.
[14] B. Sunar and Ç.K. Koç, Mastrovito Multiplier for All Trinomials IEEE Trans. Computers, vol. 48, no. 5, pp. 522527, May 1999.