A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields

A bit parallel structure for a multiplier with low complexity in Galois fields is introduced. The multiplier operates over composite fields GF((2/sup n/)/sup m/), with k=nm. The Karatsuba-Ofman algorithm (A. Karatsuba and Y. Ofmanis, 1963) is investigated and applied to the multiplication of polynomials over GF(2/sup n/). It is shown that this operation has a complexity of order O(k/sup log23/) under certain constraints regarding k. A complete set of primitive field polynomials for composite fields is provided which perform module reduction with low complexity. As a result, multipliers for fields GF(2/sup k/) up to k=32 with low gate counts and low delays are listed. The architectures are highly modular and thus well suited for VLSI implementation.

[1]  Anatolij A. Karatsuba,et al.  Multiplication of Multidigit Numbers on Automata , 1963 .

[2]  Richard J. Fateman.  Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments , 1974, SIAM J. Comput..

[3]  John J. Komo,et al.  Primitive polynomials and M-sequences over GF(qm) , 1993, IEEE Trans. Inf. Theory.

[4]  R. Blahut.  Theory and practice of error control codes , 1983 .

[5]  D. H. Green,et al.  Irreducible polynomials over composite Galois fields and their applications in coding techniques , 1974 .

[6]  Andrew M. Odlyzko,et al.  Discrete Logarithms in Finite Fields and Their Cryptographic Significance , 1985, EUROCRYPT.

[7]  Christof Paar,et al.  Implementation of a Reprogrammable Reed-SolomonDecoder over GF ( 216 ) on a Digital Signal Processorwith External Arithmetic Unit , 1994 .

[8]  Donald Ervin Knuth,et al.  The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[9]  Toshiya Itoh,et al.  Structure of Parallel Multipliers for a Class of Fields GF(2^m) , 1989, Inf. Comput..

[10]  Trieu-Kien Truong,et al.  VLSI Architectures for Computing Multiplications and Inverses in GF(2m) , 1983, IEEE Transactions on Computers.

[11]  Edoardo D. Mastrovito,et al.  VLSI Designs for Multiplication over Finite Fields GF (2m) , 1988, AAECC.

[12]  Antonio Pincin.  A New Algorithm for Multiplication in Finite Fields , 1989, IEEE Trans. Computers.

[13]  Vijay K. Bhargava,et al.  Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2^m) , 1992, IEEE Trans. Computers.