
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Christof Paar, "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields," IEEE Transactions on Computers, vol. 45, no. 7, pp. 856861, July, 1996.  
BibTex  x  
@article{ 10.1109/12.508323, author = {Christof Paar}, title = {A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields}, journal ={IEEE Transactions on Computers}, volume = {45}, number = {7}, issn = {00189340}, year = {1996}, pages = {856861}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.508323}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields IS  7 SN  00189340 SP856 EP861 EPD  856861 A1  Christof Paar, PY  1996 KW  Finite field multiplication KW  bit parallel multiplication KW  composite fields KW  polynomial multiplication KW  Karatsuba Ofman algorithm KW  primitive polynomials KW  VLSI architecture. VL  45 JA  IEEE Transactions on Computers ER   
Abstract—In this paper a new bitparallel structure for a multiplier with low complexity in Galois fields is introduced. The multiplier operates over
[1] A. Odlyzko, "Discrete Logarithms in Finite Fields and Their Cryptographic Significance," Lecture Notes in Computer Science 209, pp. 224316.Berlin: SpringerVerlag, 1984.
[2] R. Blahut, Theory and Practice of Error Control Codes.Reading, Mass.: AddisonWesley, 1983.
[3] C.C. Wang,T.K. Truong,H.M. Shao,L.J. Deutsch,J.K. Omura, and I.S. Reed,"VLSI Architectures for Computing Multiplications and Inverses inGF(2m)," IEEE Trans. Computers, vol. 34, no. 8, pp. 709716, Aug. 1985.
[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] E.D. Mastrovito,"VLSI Design for Multiplication over Finite Fields," LNCS357, Proc. AAECC6, pp. 297309,Rome, July 1988, SpringerVerlag.
[6] 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.
[7] V. Afanasyev, "Complexity of VLSI Implementation of Finite Field Arithmetic," Proc. II. Int'l Workshop Algebraic and Combinatorial Coding Theory, pp. 67,Leningrad, USSR, Sept. 1990.
[8] V. Afanasyev, "On the Complexity of Finite Field Arithmetic," Proc. Fifth Joint SovietSwedish Int'l. Workshop Information Theory, pp. 912,Moscow, USSR, Jan. 1991.
[9] A. Pincin, "A New Algorithm for Multiplication in Finite Fields," IEEE Trans. Computers, vol. 38, no. 7, pp. 1,0451,049, July 1989.
[10] D. Green and I. Taylor, "Irreducible Polynomials over Composite Galois Fields and Their Applications in Coding Techniques," Proc. IEE, vol. 121, pp. 935939, Sept. 1974.
[11] J. Komo and M. Lam, "Primitive Polynomials and mSequences over GF(qm)," IEEE Trans. Information Theory, vol. 39, pp. 643647, Mar. 1993.
[12] A. Karatsuba and Y. Ofman, "Multiplication of Multidigit Numbers on Automata," Sov. Phys.Dokl. (Engl. transl.), vol. 7, no. 7, pp. 595596, 1963.
[13] D. Knuth, The Art of Computer Programming, Vol. 2, AddisonWesley, Reading, Mass., 1998.
[14] E. Mastrovito, "VLSI Architectures for Computation in Galois Fields," PhD thesis, Linköping Univ., Dept. of Electrical Eng., Linköping, Sweden, 1991.
[15] R. Fateman, "Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments," SIAM J. Computing, vol. 7, pp. 19621, Sept. 1974.
[16] C. Paar, "Efficient VLSI Architectures for BitParallel Computation in Galois Fields," PhD thesis, (English translation), Inst. for Experimental Mathematics, Univ. of Essen, Essen, Germany, June 1994.
[17] C. Paar and O. Hooijen, "Implementation of a Reprogrammable ReedSolomon Decoder over GF(216) on a Digital Signal Processor with External Arithmetic Unit," Proc. Fourth Int'l ESA Workshop Digital Signal Processing Techniques Applied to Space Comm., King's College, London, Sept.2628 1994.