Finite field multiplier

Claim 1

A finite field multiplier for forming the product of two operands A and B expressed as a plurality of binary bits, where each operand is of the same length and wherein the relationship 2 m -1 is divisible to form an integer by m+1 wherein m is the number of bits in said operands, wherein said multiplier comprises, means for receiving an A operand of the form A=a 0 +a 1 x+a 2 x 2 +a 3 x 3 +. . . +a m-1 x m-1 means for receiving a B operand of the form B=b 0 +b 1 x+b 2 x 2 +b 3 x 3 +. . . +b m-1 x m-1 a first transpose network means for transforming the A operand into the equivalent form A'=a' 0 +a' 1 r+a' 2 r 2 +a' 3 r 3 +a' 4 r 4 +. . . +a' m r m where r m+1 =x 2m-1 =1 wherein said first transpose network means is comprised of Exclusive OR gates, a second transpose network means for transforming the B operand into the equivalent form B'=b' 0 +b' 1 r+b' 2 r 2 +b' 3 r 3 +b' 4 r 4 +. . . +b' m r m where r m+1 =x 2m-1 =1 wherein said second transpose network means is comprised of Exclusive OR gates, a plurality of first multiplier busses connected to receive the output of said first transpose network means, a plurality of second multiplier busses connected to receive the output of said second transpose network means, a plurality of AND gate groups connected in array form to said first and second plurality of multiplier busses, a plurality of product busses, at least one Exclusive OR gate connected to each of said AND gate groups and having an output connected to one of said product busses, an output inverse transpose network connected to said product busses for producing a product ##EQU15## wherein said inverse transpose network is comprised of Exclusive OR gates and the resultant product is a sequence of m bits.