# Patent

## Title
Condensed Galois field computing system

## Abstract

A condensed Galois field computing system including a multiplier circuit for multiplying first and second polynomials with coefficients over a Galois field to obtain their product; and a Galois field linear transformer circuit for applying an irreducible polynomial of power n to the product including a partial result generator responsive to terms of power n and greater in the product for providing a folded partial result and a Galois field adder for condensing the folded partial result and the terms less than power n in the product to obtain Galois field transformer of power n of the product.

## Background
FIELD OF THE INVENTION
This invention relates to a condensed Galois field computing system.
BACKGROUND OF THE INVENTION
Multiplication of polynomials with coefficients in Galois fields (GF) is widely used in communication systems for Reed Solomon (RS) coding and in advanced encryption. Galois field multiplication is difficult and time consuming for traditional digital signal processors (DSP) to perform: DSP's are optimized for finite impulse response (FIR) filtering and other multiply-accumulate (MAC) intensive operations, but do not efficiently process Galois field types of operations. One approach uses straight forward polynomial multiplication and division over the Galois field using linear feedback shift registers (LFSR's) which process one bit at a time. This is a very slow process. For example, in broadband communication for AES types of applications, where the bit rate is up to 100 megabits per second, there will be up to 12.5 million GF multiplications per second (MPS) and each multiplication may require many e.g. 60-100 operations. Another approach uses look-up tables to perform the Galois field multiplication. Typically, this approach requires 10-20 or more cycles which for 12.5 mps results in a somewhat lower but still very large number of operations e.g. 20×12.5=250 mps or more. Reed-Solomon codes have been widely accepted as the preferred error control coding scheme for broadband networks. A programmable implementation of a Reed-Solomon encoder and decoder is an attractive solution as it offers the system designer the unique flexibility to trade-off the data bandwidth and the error correcting capability that is desired based on the condition of the channel. The first step in Reed-Solomon decoding is the computing of the syndromes. The syndromes can be formally defined as Si=R mod G where i=(0, 1 . . . 15). The received code word may be expressed in polynomial form as Ri=roXN−1+rlXN−2+ . . . rN−1 where the length of the received word is N. It can be seen that computing the syndrome amounts to polynomial evaluation over the Galois field at the roots as defined by the j'th power of the i'th root of the generator polynomial. For each received word in the Reed-Solomon Algorithm there are sixteen syndromes to be calculated which raise the operations by a factor of sixteen to 400 mps—not practical on current microprocessors. Using the straight forward multiplication instead of the look-up tables raises the operation rate to 1.6 gigs per second. The need for Galois field multiplications is increasing dramatically with the expansion of the communications field and the imposition of encryption requirements on the communication data. This further complicates the matter because each domain error checking encryption needs Galois field multiplication over a different Galois field which requires different sets of look-up tables.
BRIEF SUMMARY OF THE INVENTION
It is therefore an object of this invention to provide an improved condensed Galois field computing system.
It is a further object of this invention to provide such an improved condensed Galois field computing system which requires less power and less area.
It is a further object of this invention to provide such an improved condensed Galois field computing system which is much faster than current look-up tables and linear feedback shift register (LFSR) implementations.
It is a further object of this invention to provide such an improved condensed Galois field computing system which reduces the amount of storage required.
It is a further object of this invention to provide such an improved condensed Galois field computing system which dramatically reduces the number of required operations per second.
The invention results from the realization that an improved condensed Galois field computing system which can operate as a multiplier, multiplier-adder, and multiplier-accumulator requiring less power and area can be achieved by multiplying first and second polynomials with coefficients over a Galois field to obtain their product and then using a Galois field linear transformer circuit to apply an irreducible polynomial of power n to the product including a partial result generator responsive to terms of power n and greater in the product for providing a folded partial result and a Galois field adder for condensing the folded partial result and the terms less than power n in the product to obtain the Galois field transform of power n of the product.
The subject invention, however, in other embodiments, need not achieve all these objectives and the claims hereof should not be limited to structures or methods capable of achieving these objectives.
This invention features condensed Galois field computing system, including a multiplier circuit for multiplying first and second polynomials with coefficients over a Galois field to obtain their product. There is a Galois field linear transformer circuit for applying an irreducible polynomial of power n to the product including a partial result generator responsive to terms of power n in greater in the product for providing a folded partial result. And a Galois field adder for combining the folded partial result and the terms less than power n in a product to obtain the Galois field transformer power n of the product.
In preferred embodiments, the partial result generated may include a look-up table. The look-up table may include the folded partial results for the combinations of n or greater. The look-up table may include an address generator. The address generator may provide statistically independent address access. The Galois field adder may include a three input adder. The third input to the three input adder may be a 0 and the Galois field computing system may operate as a Galois field multiplier. The Galois field in or output may be fed back to the Galois field computing system and the Galois field computing system may operate as a multiplier-accumulator. The Galois field adder output may be fed back to the multiplier circuit with one of the first and second polynomials and the other of the first and second polynomials may constitute the third input to the Galois field adder, so that the Galois field computing system operates as a multiplier-adder. The Galois field adder may include an exclusive OR circuit.
The invention also features a condensed Galois field multiplier system including a multiplier circuit for multiplying first and second polynomials with coefficients over a Galois field to obtain their product, and a Galois field linear transformer circuit for applying an irreducible polynomial of power n to the product including a partial result generator responsive to terms of power n and greater in the product for providing a folded partial result and a Galois field adder for combining the folded partial results and the terms less than power n in the product to perform a Galois field multiply operation.
The invention also features a condensed Galois field multiply-accumulate system including a multiplier circuit for multiplying first and second polynomials with coefficients over a Galois field to obtain their product, and a Galois field linear transformer circuit for applying an irreducible polynomial of power n to the product including a partial result generator responsive to terms of power n and greater in the product for providing a folded partial result and a Galois field adder for combining the folded partial results, the terms less than power n in the product and the Galois field adder fed back to perform a Galois field multiply-accumulate operation.
The invention also features a condensed Galois field multiplier-adder system including a multiplier circuit for multiplying first and second polynomials with coefficients over a Galois field to obtain their product, a Galois field linear transformer circuit for applying an irreducible polynomial of power n to the product including a partial result generator responsive to terms of power n and greater in the product for providing a folded partial result and a Galois field adder whose output is fed back to the multiplier circuit with one of the first and second polynomials and the other of the polynomials is a third input to the Galois field adder along with the folded partial results and the terms less than power n in the product to perform a Galois field multiply-add operation.



BRIEF DESCRIPTION OF THE DRAWINGS
Other objects, features and advantages will occur to those skilled in the art from the following description of a preferred embodiment and the accompanying drawings, in which:
FIG. 1 is a schematic block diagram of a condensed Galois field computing system according to this invention;
FIG. 2 is a schematic block diagram of the folded partial results look-up table of FIG. 1;
FIG. 3 is a schematic block diagram similar to FIG. 1 with the Galois adder having a third input set for operation as a Galois field multiplier;
FIG. 4 is a schematic block diagram similar to FIG. 1 with the Galois adder having a third input connected for operation as a Galois field multiplier-accumulator; and
FIG. 5 is a schematic block diagram similar to FIG. 1 with the Galois adder having a third input connected for operation as a Galois field multiplier-adder.



DISCLOSURE OF THE PREFERRED EMBODIMENT
Aside from the preferred embodiment or embodiments disclosed below, this invention is capable of other embodiments and of being practiced or being carried out in various ways. Thus, it is to be understood that the invention is not limited in its application to the details of construction and the arrangements of components set forth in the following description or illustrated in the drawings. If only one embodiment is described herein, the claims hereof are not to be limited to that embodiment. Moreover, the claims hereof are not to be read restrictively unless there is clear and convincing evidence manifesting a certain exclusion, restriction, or disclaimer.
There is shown in FIG. 1 a condensed Galois field computing system 10 according to this invention including a polynomial multiplier 12, a Galois field transformer 13 including a look-up table 14, and a Galois field adder such as exclusive OR gate 16 having two inputs 18 and 20.
In operation an 8-bit polynomial with coefficient over GF(28) X (x7-x0) is multiplied by an 8-bit polynomial Y (y7-y0) in polynomial multiplier 12. The polynomial product is a 14-bit number. Instead of dividing this 14-bit polynomial product by the field irreducible polynomial of power n to get the modulo reminder as would normally be the procedure, in accordance with this invention, those terms of the polynomial product which are less than the power n of the irreducible polynomial are delivered directly to the Galois Field adder input 18 of exclusive OR gate 16. Those terms in the product which have powers of n or greater are used to access a partial result stored in look-up table 14 which when provided at input 20 to exclusive OR gate 16 and exclusively ORed or Galois field added by exclusive OR gate 16, produce the Galois field transform Z of 8-bits z7-z0. The realization of this invention is that the terms that are below a power n are unaffected by the reduction process (division of the product by an irreducible polynomial where n is the power of that irreducible polynomial), and so they can be delivered directly without any further operation or manipulation to input 18 of Galois field adder 16. Those of the power n or above must go through the reduction process where they are replaced by a folded partial result using a look-up table, which is then added in adder 16 to the lower power terms from input 18 to produce the proper Galois field output. (A partial result look-up table value is generated by expressing all the product terms of power of n or above in terms of power of n−1 or less and accumulating all the terms). For example, if the irreducible polynomial chosen has a power of eight, all those terms in the product from polynomial multiplier 12 which have power seven or below would be delivered directly to input 18 while those that had a power of eight or above would be used on line 22 to access the folded partial result in look-up table 14 which when added to the lower power terms on input 18 produce the proper Galois field output.
Galois field polynomial multiplication can be implemented in two basic steps. The first is a calculation of the polynomial product. c(x)=a(x)*b(x) is algebraically expanded, and like powers are collected (addition corresponds to an X-OR operation between the corresponding terms) to give c(x).

    For example c(x)=(a7x7+a6x6+a5x5+a4x4+a3x3+a2x2+a1x1+a0)*(b7x7+b6x6+b5x5+b4x4+b3x3+b2x3+b1x1+b0)
    C(x)=c14x14+c13x13+c12x12+c11x11+c10x10+c9x9+c8x8+c7x7+c6x6+c5x5+c4x4+c3x3+c2x2+c1x1+c0 

where:










CHART I







c14 = a7 * b7


c13 = a7 * b6 ⊕ a6 * b7


c12 = a7 * b5 ⊕ a6 * b6 ⊕ a5 * b7


c11 = a7 * b4 ⊕ a6 * b5 ⊕ a5 * b6 ⊕ a4 * b7


c10 = a7 * b3 ⊕ a6 * b4 ⊕ a5 * b5 ⊕ a4 * b6 ⊕ a3 * b7


c9 = a7 * b2 ⊕ a6 * b3 ⊕ a5 * b4 ⊕ a4 * b5 ⊕ a3 * b6 ⊕ a2 * b7


c8 = a7 * b1 ⊕ a6 * b2 ⊕ a5 * b3 ⊕ a4 * b4 ⊕ a3 * b5 ⊕ a2 * b6 ⊕


a1 * b7


c7 = a7 * b0 ⊕ a6 * b1 ⊕ a5 * b2 ⊕ a4 * b3 ⊕ a3 * b4 ⊕ a2 * b5 ⊕


a1 * b6 ⊕ a0 * b7


c6 = a6 * b0 ⊕ a5 * b1 ⊕ a4 * b2 ⊕ a3 * b3 ⊕ a2 * b4 ⊕ a1 * b5 ⊕


a0 * b6


c5 = a5 * b0 ⊕ a4 * b1 ⊕ a3 * b2 ⊕ a2 * b3 ⊕ a1 * b4 ⊕ a0 * b5


c4 = a4 * b0 ⊕ a3 * b1 ⊕ a2 * b2 ⊕ a1 * b3 ⊕ a0 * b4


c3 = a3 * b0 ⊕ a2 * b1 ⊕ a1 * b2 ⊕ a0 * b3


c2 = a2 * b0 ⊕ a1 * b1 ⊕ a0 * b2


c1 = a1 * b0 ⊕ a0 * b1


c0 = a0 * b0









The second is the calculation of d(x)=c(x) modulo p(x).
To illustrate, multiplications are performed with the multiplication of polynomials modulo an irreducible polynomial. For example: (if m(x)=x8+x4+x3+x+1) {57}*{83}={c1} because,
First Step




  
    
      
        
          
            (
            
              
                x
                6
              
              +
              
                x
                4
              
              +
              
                x
                2
              
              +
              x
              +
              1
            
            )
          
          +
          
            (
            
              
                x
                7
              
              +
              x
              +
              1
            
            )
          
        
        =
        
        ⁢
        
          
            x
            13
          
          ⊕
          
            x
            11
          
          ⊕
          
            x
            9
          
          ⁢
          
            ⊕
            8
          
          ⁢
          
            ⊕
            
              x
              7
            
          
        
      
    
  
  
    
      
        
        ⁢
        
          
            x
            7
          
          ⊕
          
            x
            5
          
          ⊕
          
            x
            3
          
          ⊕
          
            x
            2
          
          ⊕
          x
        
      
    
  
  
    
      
        
        ⁢
        
          
            x
            6
          
          ⊕
          
            x
            4
          
          ⊕
          
            x
            2
          
          ⊕
          x
          ⊕
          x
        
      
    
  
  
    
      
        =
        
        ⁢
        
          
            x
            13
          
          ⊕
          
            x
            11
          
          ⊕
          
            x
            9
          
          ⊕
          
            x
            8
          
          ⊕
          
            x
            6
          
          ⊕
          
            x
            5
          
        
      
    
  
  
    
      
        
        ⁢
        
          ⊕
          
            
              x
              4
            
            ⊕
            
              x
              3
            
            ⊕
            1
          
        
      
    
  




Second Step
For the irreducible polynomial x8+x4+x3+x+1
If the polynomial multiplication product=x13⊕x11 ⊕x9 ⊕x8 ⊕x6 ⊕x5 ⊕x4 ⊕x3 ⊕1 then each of the terms of power n (8) or above are expressed in terms of n−1=7 or less:

x8=x4+x3+x+1

x9=x·x8=x(x4+x3+x+1)=x5+x4+x2+x 

x11=x·x8=x3(x4+x3+x+1)=x7+x6+x4+x3 

x13=x5·x8=x5(x4+x3+x+1)=x9+x8+x6+x5 which simplifies to x6+x3+x2+1

Assigning a 1 to each term to express the terms of power n and above























x7
x6
x5
x4
x3
x2
x1
x0







Terms of

x8



1
1

1
1


powder n and

x9


1
1

1
1


greater in
 {open oversize brace} 
x11
1
1

1
1


polynomial product

x13

1


1
1

1















Folded Partial Result in LUT 14
1
0
1
1
1
0
0
0









By Galois field addition (X-OR 16) of terms of powers less than n in the product with the folded Partial Result for LUT 14 the first Galois field output is obtained.




















x7
x6
x5
x4
x3
x2
x1
x0

























Product terms of power n-1 less

0
1
1
1
1
0
0
1



⊕


Folded Partial Result in LUT 14

1
0
1
1
1
0
0
0















Galois Field adder (X-OR)16 output
1
1
0
0
0
0
0
1 = x7 + x6 + 1 = 0xc1









The irreducible polynomial used in this case: x8+x4+x3+x+1 is only one of many that may be used. For example, any one of those shown in Chart II may be used:









CHART II









:GF(21)



0x3 (x + 1)



:GF(22)



0x7 (x2 + x + 1)



:GF(23)



0xB (x3 + x + 1)



0xD (x3 + x2 + 1)



:GF(24)



0x13 (x4 + x + 1)



0x19 (x4 + x3 + 1)



:GF(25)



0x25 (x5 + x2 + 1)



0x29 (x5 + x3 + 1)



0x2F (x5 + x3 + x2 + x + 1)



0x37 (x5 + x4 + x2 + x + 1)



0x3B (x5 + x4 + x3 + x + 1)



0x3D (x5 + x4 + x3 + x2 + 1)



:GF(26)



0x43 (x6 + x + 1)



0x5B (x6 + x4 + x3 + x + 1)



0x61 (x6 + x5 + 1)



0x67 (x6 + x5 + x2 + x + 1)



0x6D (x6 + x5 + x3 + x2 + 1)



0x73 (x6 + x5 + x4 + x + 1)



:GF(27)



0x83 (x7 + x + 1)



0x89 (x7 + x3 + 1)



0x8F (x7 + x3 + x2 + x + 1)



0x91 (x7 + x4 + 1)



0x9D (x7 + x4 + x3 + x2 + 1)



0xA7 (x7 + x5 + x2 + x + 1)



0xAB (x7 + x5 + x3 + x + 1)



0xB9 (x7 + x5 + x4 + x3 + 1)



0xBF (x7 + x5 + x4 + x3 + x2 + x + 1)



0xC1 (x7 + x6 + 1)



0xCB (x7 + x6 + x3 + x + 1)



0xD3 (x7 + x6 + x4 + x + 1)



0xE5 (x7 + x6 + x5 + x2 + 1)



0xF1 (x7 + x6 + x5 + x4 + 1)



0xF7 (x7 + x6 + x5 + x4 + x2 + x + 1)



0xFD (x7 + x6 + x5 + x4 + x3 + x2 + 1)



:GF(28)



0x11D (x8 + x4 + x3 + x2 + 1)



0x12B (x8 + x5 + x3 + x + 1)



0x12D (x8 + x5 + x3 + x2 + 1)



0x14D (x8 + x6 + x3 + x2 + 1)



0x15F (x8 + x6 + x4 + x3 + x2 + x + 1)



0x163 (x8 + x6 + x5 + x + 1)



0x165 (x8 + x6 + x5 + x2 + 1)



0x169 (x8 + x6 + x5 + x3 + 1)



0x171 (x8 + x6 + x5 + x4 + 1)



0x187 (x8 + x7 + x2 + x + 1)



0x18D (x8 + x7 + x3 + x2 + 1)



0x1A9 (x8 + x7 + x5 + x3 + 1)



0x1C3 (x8 + x7 + x6 + x + 1)



0x1CF (x8 + x7 + x5 + x3 + x2 + x + 1)



0x1E7 (x8 + x7 + x6 + x5 + x2 + x + 1)



0x1F5 (x8 + x7 + x5 + x4 + x2 + 1)










In summary, applying the irreducible polynomial 0x11b (x8+x4+x3+x+1) having a power n=8 to the polynomial product 30, FIG. 2, from the polynomial multiplier 12, that product can be viewed in two sections 32 and 34. Section 32 contains all of those terms of powers less than n, where n=8 and section 34 represents all of those terms in polynomial product 30 which have powers of 8 or greater. Since the irreducible polynomial that we chose to deal with has a power n=8, there will be 128 possible combinations or folded partial results that are stored in look-up table 14. Each one is addressed by a different combination of terms which make up the n or greater section 34. More information on Galois field transformers and multipliers may be found in U.S. Pat. No. 6,587,864 B2 issued Jul. 1, 2003, Stein et al., entitled, GALOIS FIELD LINEAR TRANSFORMER, U.S. Pat. No. 6,766,345 B2 issued Jul. 20, 2004, Stein et al. entitled, GALOIS FIELD MULTIPLIER SYSTEM, and U.S. Pat. No. 7,177,891 B2 issued Feb. 13, 2007, Stein et al., entitled COMPACT GALOIS FIELD MULTIPLIER ENGINE, each of which is herein incorporated in its entirety by this reference.
Condensed Galois field computing system 10a, according to this invention, may be more generalized using a Galois field adder, exclusive OR gate 16a, that includes three inputs the third input 36 may be a 0 when Galois field computing system 10a is operated as a multiplier. There may also be provided an address generator including adder circuit 38 and base address circuits 40. Then, for example, for advanced encryption standards (AES) look-up table 14a may have a base of 0 added to the addresses coming in on line 22a so that the addresses will be from 0 to 127, and for a Reed-Solomon operation base 40 may add the number 128 to the address coming in on 22a to access addresses from 128 to 255. In that way the different irreducible polynomial based Galois Field multipliers can coexist in the same system. Based on the fact that the base address is a multiple of 27 (the last 7 Lsb's are guaranteed to be “zero”) and the address generator adder 38 can be simplified to be a simple OR-circuit. The condensed Galois field computing system according to this invention, 10b, FIG. 4, can be operated as a multiplier-accumulator by applying the output from Galois field adder, exclusive OR gate 16b, back to OR gate 16b. 
And it may be operated as multiplier-adder 10c, FIG. 5, by applying one of the polynomials X to polynomial multiplier 12c while the other one Y is applied to input 36c of Galois field adder, exclusive OR gate 16c. The output of Galois field adder 16c is fed back over line 50 to the other input of polynomial multiplier 12c. Further discussion of Galois field multiply-add and other Galois field operations are discussed in U.S. Pat. No. 7,082,452 B2 issued Jul. 25, 2006, Stein et al. entitled GALOIS FIELD MULTIPLY/MULTIPLY-ADD/MULTIPLY ACCUMULATE, and U.S. patent application Ser. No. 10/440,330 filed May 16, 2003, Stein et al. entitled COMPOUND GALOIS FIELD ENGINE AND GALOIS FIELD DIVIDER AND SQUARE ROOT ENGINE AND METHOD, each of which is herein incorporated in its entirety by this reference.
Although specific features of the invention are shown in some drawings and not in others, this is for convenience only as each feature may be combined with any or all of the other features in accordance with the invention. The words “including”, “comprising”, “having”, and “with” as used herein are to be interpreted broadly and comprehensively and are not limited to any physical interconnection. Moreover, any embodiments disclosed in the subject application are not to be taken as the only possible embodiments.
Other embodiments will occur to those skilled in the art and are within the following claims.
In addition, any amendment presented during the prosecution of the patent application for this patent is not a disclaimer of any claim element presented in the application as filed: those skilled in the art cannot reasonably be expected to draft a claim that would literally encompass all possible equivalents, many equivalents will be unforeseeable at the time of the amendment and are beyond a fair interpretation of what is to be surrendered (if anything), the rationale underlying the amendment may bear no more than a tangential relation to many equivalents, and/or there are many other reasons the applicant can not be expected to describe certain insubstantial substitutes for any claim element amended.

## Claims

1. A condensed Galois field computing system comprising:
a multiplier circuit for multiplying first and second polynomials with coefficients over a Galois field to obtain their product; and
a Galois field transformer circuit for applying an irreducible polynomial of power n to said product including a partial result generator responsive to terms of power n and greater in said product for providing a folded partial result and a Galois field adder for combining said folded partial result and the terms less than power n in the product to obtain Galois field transform of power n of said product, said partial result generator including a look-up table that includes the folded partial results for the terms with the power of n or greater, the computing system used for error correction and/or encryption.

2. The condensed Galois field computing system of claim 1 in which said look-up table includes an address generator for said selecting one of the folded partial results tables.

3. The condensed Galois field computing system of claim 2 in which said address generator provides statically independent address access.

4. The condensed Galois field computing system of claim 2 in which said address generator includes an OR circuit for combining said terms of n and greater and said value of base address to generate the look-up table address.

5. The condensed Galois field computing system of claim 1 in which said Galois field adder includes a three input adder.

6. The condensed Galois field computing system of claim 5 in which said third input to said three input adder is a zero and said Galois field computing system operates as a Galois field multiplier.

7. The condensed Galois field computing system of claim 5 in which said third input to said three input adder is the Galois field adder output fed back and said Galois field computing system operates as a multiplier-accumulator.

8. The condensed Galois field computing system of claim 5 in which the Galois field adder output is fed back to said multiplier circuit with one of said first and second polynomials and the other of said polynomials is the third input to said Galois field adder and said Galois field computing system operates as a multiplier-adder.

9. The condensed Galois field computing system of claim 1 in which the Galois field adder includes an exclusive OR circuit.

10. The condensed Galois field computing system of claim 1 in which said look-up table includes at least one folded partial results table.

11. A condensed Galois field multiplier system comprising:
a multiplier circuit for multiplying first and second polynomials with coefficients over a Galois field to obtain their product; and
a Galois field transformer circuit for applying an irreducible polynomial of power n to said product including a partial result generator responsive to terms of power n and greater in said product for providing a folded partial result and a Galois field adder for combining said folded partial results and the terms less than power n in the product to perform a Galois field multiply operation, said partial result generator including a look-up table that includes the folded partial results for the terms with the power of n or greater, the multiplier system used for error correction and/or encryption.

12. A condensed Galois field multiply-accumulate system comprising:
a multiplier circuit for multiplying first and second polynomials with coefficients over a Galois field to obtain their product; and
a Galois field transformer circuit for applying an irreducible polynomial of power n to said product including a partial result generator responsive to terms of power n and greater in said product for providing a folded partial result and a Galois field adder for combining said folded partial results, the terms less than power n in the product and the output of the Galois field adder fed back to perform a Galois field multiply-accumulate operation, said partial result generator including a look-up table that includes the folded partial results for the terms with the power of n or greater, the multiply-accumulate system used for error correction and/or encryption.

13. A condensed Galois field multiplier-adder system comprising:
a multiplier circuit for multiplying first and second polynomials with coefficients over a Galois field to obtain their product; and
a Galois field transformer circuit for applying an irreducible polynomial of power n to said product including a partial result generator responsive to terms of power n and greater in said product for providing a folded partial result and a Galois field adder whose output is fed back to said multiplier circuit with one of said first and second polynomials and the other of said polynomials is a third input to said Galois field adder along with said folded partial results and the terms less than power n in the product to perform a Galois field multiply-add operation, said partial result generator including a look-up table that includes the folded partial results for the terms with the power of n or greater, the multiplier-adder system used for error correction and/or encryption.