← Back to Patent Explorer
US4251875A Expired / Lapsed US ⏱️ 0.0 years remaining

Sequential Galois multiplication in GF(2n) with GF(2m) Galois multiplication gates

Assignee: Unisys Corp
•
Filing: 1979-02-12
•
Granted: 1981-02-17
•
Expires: 1999-02-12
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Configurations of Boolean elements for implementing a sequential GF(2 n ) Galois multiplication gate are disclosed. Each configuration includes a single subfield GF(2 m ) Galois multiplication gate, where m is a positive integral divisor of n, e.g., n=8 and m=2, and assorted controls. Also disclosed is a sequential implementation of a GF(2 n ) Galois linear module as described in the J. T. Ellison Pat. No. 3,805,037 wherein the controls of the sequential GF(2 n ) multiply gate cause the Galois addition (bit-wise Exclusive-OR) of an n-bit binary vector, Z, to the final Galois product.

Inventors

  • 👤 James M. Marver
  • 👤 Wayne R. Olson

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 20:36
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/60; G06F7/72; G06F7/724; G06F2207/00; G06F2207/72; G06F2207/7209

Claims Analysis

Total Claims: 18
Claim 1
Independent Claim 227 words
A Galois GF(2 n ) multiplication gate for performing the Galois multiplication in the Galois field GF(2 n ) which Galois GF(2 n ) multiplication gate generates the Galois product X·Y=(X·Y) 0 , . . . , (X·Y) n-1 from the Galois input on n, X input lines X.sub.0, . . . , X.sub.n-1 and from the Galois input on n, Y input lines Y.sub.0, . . . , Y.sub.n-1 comprising: a single GF(2 m ) Galois multiplication gate having the Galois subfield GF(2 m ) where m is a positive integral divisor of n having the relationship of k=n/m, where k is a positive integer greater than 1, k>1, which single GF(2 m ) Galois multiplication gate generates k 2 subfield GF(2 m ) Galois partial products; input sequencer means receiving said X and Y n-bit inputs and sequential coupling k m-bit portions of each of said X and Y n-bit inputs to said single GF(2 m ) Galois multiplication gate for enabling said single GF(2 m ) Galois multiplication gate to sequentially generate said k 2 subfield GF(2 m ) Galois partial products therefrom; and, means including constant multiplier means, responsively coupled to said single GF(2 m ) Galois multiplication gate and sequentially accumulating said sequentially generated k 2 subfield GF(2 m ) products for providing on n output lines the n-bit Galois product X·Y.
Claim 2
Dependent Claim 227 words
A Galois GF(2 n ) multiplication gate for performing the Galois multiplication in the Galois field GF(2 n ) which Galois GF(2 n ) multiplication gate generates the Galois product X·Y=(X·Y) 0 , . . . , (X·Y) n-1 from the Galois input on n, X input lines X.sub.0, . . . , X.sub.n-1 and from the Galois input on n, Y input lines Y.sub.0, . . . , Y.sub.n-1 comprising: a single GF(2 m ) Galois multiplication gate having the Galois subfield GF(2 m ) where m is a positive integral divisor of n having the relationship of k=n/m, where k is a positive integer greater than 1, k>1, which single GF(2 m ) Galois multiplication gate generates k 2 subfield GF(2 m ) Galois partial products; input sequencer means receiving said X and Y n-bit inputs and sequential coupling k m-bit portions of each of said X and Y n-bit inputs to said single GF(2 m ) Galois multiplication gate for enabling said single GF(2 m ) Galois multiplication gate to sequentially generate said k 2 subfield GF(2 m ) Galois partial products therefrom; and, means including constant multiplier means, responsively coupled to said single GF(2 m ) Galois multiplication gate and sequentially accumulating said sequentially generated k 2 subfield GF(2 m ) products for providing on n output lines the n-bit Galois product X·Y.
Claim 3
Dependent Claim 288 words
A Galois GF(2 n ) multiplication gate for performing the Galois multiplication in the Galois field GF(2 n ) which Galois GF(2 n ) multiplication gate generates the Galois product X·Y=(X·Y) 0 , . . . , (X·Y) n-1 from the Galois input on n, X input lines X.sub.0, . . . , X.sub.n-1 and from the Galois input on n, Y input lines Y.sub.0, . . . , Y.sub.n-1 comprising: a single GF(2 m ) Galois multiplication gate having the Galois subfield GF(2 m ), where m is a positive integral divisor of n having the relationship of k=n/m and where k is a positive integer greater than 1, k>1, which single GF(2 m ) Galois multiplication gate generates k 2 subfield GF(2 m ) Galois partial products; X input register means for bi-serially receiving said n-bit X input and for sequentially bit-parallelly coupling m-bit portions of said n-bit X input to said single GF(2 m ) Galois multiplication gate; Y input register means for bit-serially receiving said n-bit Y input and for sequentially bit-parallelly coupling m-bit portions of n-bit Y input to said single GF(2 m ) Galois multiplication gate; ·t.sup.2.spsp.m.sup.-2, ·t.sup.2.spsp.m.sup.-3, . . . , ·t.sup.d, . . . , .t.sup.2, ·t, ·1, ·0 constant multiplier means responsively coupled to said single GF(2 m ) Galois multiplication gate for seuentially receiving said k 2 subfield GF(2 m ) Galois partial products and sequentially generating k 2 sets of GF(2 m )·t d or GF(2 m ) ·0 Galois partial products therefrom; and, accumulator means sequentially receiving and accumulating said k 2 sets of subfield GF(2 m )·t d or GF(2 m )·0 Galois partial products for generating and bit-serially outputting said n-bit Galois product X·Y.
Claim 4
Dependent Claim 288 words
A Galois GF(2 n ) multiplication gate for performing the Galois multiplication in the Galois field GF(2 n ) which Galois GF(2 n ) multiplication gate generates the Galois product X·Y=(X·Y) 0 , . . . , (X·Y) n-1 from the Galois input on n, X input lines X.sub.0, . . . , X.sub.n-1 and from the Galois input on n, Y input lines Y.sub.0, . . . , Y.sub.n-1 comprising: a single GF(2 m ) Galois multiplication gate having the Galois subfield GF(2 m ), where m is a positive integral divisor of n having the relationship of k=n/m and where k is a positive integer greater than 1, k>1, which single GF(2 m ) Galois multiplication gate generates k 2 subfield GF(2 m ) Galois partial products; X input register means for bi-serially receiving said n-bit X input and for sequentially bit-parallelly coupling m-bit portions of said n-bit X input to said single GF(2 m ) Galois multiplication gate; Y input register means for bit-serially receiving said n-bit Y input and for sequentially bit-parallelly coupling m-bit portions of n-bit Y input to said single GF(2 m ) Galois multiplication gate; ·t.sup.2.spsp.m.sup.-2, ·t.sup.2.spsp.m.sup.-3, . . . , ·t.sup.d, . . . , .t.sup.2, ·t, ·1, ·0 constant multiplier means responsively coupled to said single GF(2 m ) Galois multiplication gate for seuentially receiving said k 2 subfield GF(2 m ) Galois partial products and sequentially generating k 2 sets of GF(2 m )·t d or GF(2 m ) ·0 Galois partial products therefrom; and, accumulator means sequentially receiving and accumulating said k 2 sets of subfield GF(2 m )·t d or GF(2 m )·0 Galois partial products for generating and bit-serially outputting said n-bit Galois product X·Y.
Claim 5
Dependent Claim 342 words
A Galois GF(2 n ) multiplication gate for performing the Galois multiplication in the Galois field GF(2 n ) which Galois GF(2 n ) multiplication gate generates the Galois product X·Y=(X·Y) 0 , . . . , (X·Y) n-1 from the Galois input on n, X input lines X.sub.0, . . . , X.sub.n-1 and from the Galois input on n, Y input lines Y.sub.0, . . . , Y.sub.n-1 comprising: GF(2 m ) Galois multiplication gate means having the Galois subfield GF(2 m ), where m is a positive integral divisor of n having the relationship of k=n/m and where k is a positive integer greater than 1, k>1, which GF(2 m ) Galois multiplication gate means generates k 2 subfield GF(2 m ) Galois partial products; input sequencer means for receiving said Galois input on said n, X input lines and said Galois input on said n, Y input lines and sequentially coupling m-bit segments of X(X m ) and Y(Y m ) to said GF(2 m ) Galois multiplication gate means; ·t.sup.2.spsp.m.sup.-2, ·t.sup.2.spsp.m.sup.-3, . . . , ·t.sup.d, . . . , ·t.sup.2 ·t, ·1, ·0 constant multiplier means responsively coupled to said GF(2.sup.m) Galois multiplication gate means for sequentially receiving said k.sup.2 subfield GF(2.sup.m) Galois partial products and sequentially generating k.sup.2 sets of GF(2.sup.m)·t.sup.d or GF(2.sup.m)·0 Galois partial products therefrom; n/m multiplexer means, each receiving in parallel, said k 2 sets of GF(2 m )·t d or GF(2 m )·0 Galois products from said constant multiplier means; n/m toggle means, each coupled to a respectively associated one of said n/m multiplexer means for receiving the output therefrom; output register means coupled to each of said n/m toggle means for receiving and formatting the outputs therefrom in an n-bit format, and control sequencer means coupled to said input sequencer means, said n/m multiplexer means and said n/m toggle means for sequentially processing said m-bit segments of X(X m ) and Y(Y m ) from said input sequencer means to form said Galois product X·Y at said output register means.
Claim 6
Dependent Claim 342 words
A Galois GF(2 n ) multiplication gate for performing the Galois multiplication in the Galois field GF(2 n ) which Galois GF(2 n ) multiplication gate generates the Galois product X·Y=(X·Y) 0 , . . . , (X·Y) n-1 from the Galois input on n, X input lines X.sub.0, . . . , X.sub.n-1 and from the Galois input on n, Y input lines Y.sub.0, . . . , Y.sub.n-1 comprising: GF(2 m ) Galois multiplication gate means having the Galois subfield GF(2 m ), where m is a positive integral divisor of n having the relationship of k=n/m and where k is a positive integer greater than 1, k>1, which GF(2 m ) Galois multiplication gate means generates k 2 subfield GF(2 m ) Galois partial products; input sequencer means for receiving said Galois input on said n, X input lines and said Galois input on said n, Y input lines and sequentially coupling m-bit segments of X(X m ) and Y(Y m ) to said GF(2 m ) Galois multiplication gate means; ·t.sup.2.spsp.m.sup.-2, ·t.sup.2.spsp.m.sup.-3, . . . , ·t.sup.d, . . . , ·t.sup.2 ·t, ·1, ·0 constant multiplier means responsively coupled to said GF(2.sup.m) Galois multiplication gate means for sequentially receiving said k.sup.2 subfield GF(2.sup.m) Galois partial products and sequentially generating k.sup.2 sets of GF(2.sup.m)·t.sup.d or GF(2.sup.m)·0 Galois partial products therefrom; n/m multiplexer means, each receiving in parallel, said k 2 sets of GF(2 m )·t d or GF(2 m )·0 Galois products from said constant multiplier means; n/m toggle means, each coupled to a respectively associated one of said n/m multiplexer means for receiving the output therefrom; output register means coupled to each of said n/m toggle means for receiving and formatting the outputs therefrom in an n-bit format, and control sequencer means coupled to said input sequencer means, said n/m multiplexer means and said n/m toggle means for sequentially processing said m-bit segments of X(X m ) and Y(Y m ) from said input sequencer means to form said Galois product X·Y at said output register means.
Claim 7
Dependent Claim 358 words
A Galois GF(2 n ) multiplication gate for performing the Galois multiplication in the Galois field GF(2 n ) which Galois GF(2 n ) multiplication gate generates the Galois product X·Y=(X·Y) 0 , . . . , (X·Y) n-1 from the Galois input on n, X input lines X.sub.0, . . . , X.sub.n-1 and from the Galois input on n, Y input lines Y.sub.0, . . . , Y.sub.n-1 comprising: GF(2 m )Galois multiplication gate means having the Galois subfield GF(2 m ), where m is a positive integral divisor of n having the relationship of k=n/m and where k is a positive integer greater than 1, k>1, which GF(2 m ) Galois multiplication gate means generates k 2 subfield GF(2 m ) Galois partial products; X input register means for bit-serially receiving said n-bit X input and for sequentially bit-paralelly coupling m-bit portions of said n-bit X input to said GF(2 m ) Galois multiplication gate means; Y input register means for bit-serially receiving said n-bit Y input and for sequentially bit-parallelly coupling m-bit portions of said n-bit Y input to said GF(2 m ) Galois multiplication gate means; X m ·Y m register means for receiving and storing said k 2 subfield GF(2 m ) Galois partial products from said GF(2 m ) multiplication gate means; ·t d constant multiplier means receiving said k 1 subfield GF(2 n ) Galois partial products from said X m ·Y m register means for performing the appropriate constant multiply for each of said k 2 subfield GF(2 m ) Galois partial products; Galois sum means for receiving the output of said ·t d constant multiplier means; output register means for receiving said storing the output of said Galois sum means; and, multiplexer means sequentially coupling the contents of said output register means to said Galois sum means for sequentially enabling said Galois sum means to perform the Galois sum of the output of said ·t d constant multiplier means and said output register means for each of said k 2 subfield GF(2 m ) Galois partial products and generating in said output register means said Galois product X·Y.
Claim 8
Dependent Claim 358 words
A Galois GF(2 n ) multiplication gate for performing the Galois multiplication in the Galois field GF(2 n ) which Galois GF(2 n ) multiplication gate generates the Galois product X·Y=(X·Y) 0 , . . . , (X·Y) n-1 from the Galois input on n, X input lines X.sub.0, . . . , X.sub.n-1 and from the Galois input on n, Y input lines Y.sub.0, . . . , Y.sub.n-1 comprising: GF(2 m )Galois multiplication gate means having the Galois subfield GF(2 m ), where m is a positive integral divisor of n having the relationship of k=n/m and where k is a positive integer greater than 1, k>1, which GF(2 m ) Galois multiplication gate means generates k 2 subfield GF(2 m ) Galois partial products; X input register means for bit-serially receiving said n-bit X input and for sequentially bit-paralelly coupling m-bit portions of said n-bit X input to said GF(2 m ) Galois multiplication gate means; Y input register means for bit-serially receiving said n-bit Y input and for sequentially bit-parallelly coupling m-bit portions of said n-bit Y input to said GF(2 m ) Galois multiplication gate means; X m ·Y m register means for receiving and storing said k 2 subfield GF(2 m ) Galois partial products from said GF(2 m ) multiplication gate means; ·t d constant multiplier means receiving said k 1 subfield GF(2 n ) Galois partial products from said X m ·Y m register means for performing the appropriate constant multiply for each of said k 2 subfield GF(2 m ) Galois partial products; Galois sum means for receiving the output of said ·t d constant multiplier means; output register means for receiving said storing the output of said Galois sum means; and, multiplexer means sequentially coupling the contents of said output register means to said Galois sum means for sequentially enabling said Galois sum means to perform the Galois sum of the output of said ·t d constant multiplier means and said output register means for each of said k 2 subfield GF(2 m ) Galois partial products and generating in said output register means said Galois product X·Y.
Claim 9
Dependent Claim 22 words
The Galois GF(2 n ) multiplication gate of claim 4 in which said GF(2 m ) multiplication gate means is a PROM.
Claim 10
Dependent Claim 24 words
The Galosis GF(2 n ) multiplication gate of claim 4 in which said ·t d constant multiplier means is a ·t d PROM means.
Claim 11
Dependent Claim 50 words
The Galois GF(2 n ) multiplication gate of claim 6 further including ·t d Select PROM means coupled to said ·t d PROM means for enabling said ·t d PROM means to select the appropriate constant multiply for each of said k 2 subfield GF(2 m ) Galois partial products.
Claim 12
Dependent Claim 344 words
A Galois GF(2 n ) multiplication gate for performing the Galois multiplication in the Galois field GF(2 n ) which Galois GF(2 n ) multiplication gate generates the Galois product X·Y=(X·Y) 0 , . . . , (X·Y) n-1 from the Galois input on n, X input lines X.sub.0, . . . , X.sub.n-1 and from the Galois input on n, Y input lines Y.sub.0, . . . , Y.sub.n-1 comprising: GF(2m) Galois multiplication gate means having the Galois subfield GF(2 m ), where m is a positive integral divisor of n having the relationship of k=n/m and where k is a positive integer greater than 1, k>1, which GF(2 m ) Galois multiplication gate means generates k 2 subfield GF(2 m ) Galois partial products; X input means for receiving said n-bit X input and for sequentially coupling m-bit portions of said n-bit X input to said GF(2 m ) Galois multiplication gate means; Y input means for receiving said n-bit Y input and for sequentially coupling m-bit portions of said n-bit Y input to said GF(2 m ) Galois multtiplication gate means; X m ·Y means for receiving and storing said k 2 subfield GF(2 m ) Galois partial products from said GF(2 m ) multiplication gate means; ·t d constant multiplier means receiving said k 2 subfield GF(2 m ) Galois partial products from said X m ·Y m means for performing the appropriate constant multiply for each of said k 2 subfield GF(2 m ) Galois partial products; Galois sum means for receiving the output of said ·t d constant multiplier means; output means for receiving and storing the output of said Galois sum means; and, multiplexer means sequentially coupling the contents of said output means to said Galois sum means for sequentially enabling said Galois sum means to perform the Galois sum of the output of said ·t d constant multiplier means and said output means for each of said k 2 subfield GF(2 m ) Galois partial products and generating in said output means said Galois product X·Y.
Claim 13
Dependent Claim 344 words
A Galois GF(2 n ) multiplication gate for performing the Galois multiplication in the Galois field GF(2 n ) which Galois GF(2 n ) multiplication gate generates the Galois product X·Y=(X·Y) 0 , . . . , (X·Y) n-1 from the Galois input on n, X input lines X.sub.0, . . . , X.sub.n-1 and from the Galois input on n, Y input lines Y.sub.0, . . . , Y.sub.n-1 comprising: GF(2m) Galois multiplication gate means having the Galois subfield GF(2 m ), where m is a positive integral divisor of n having the relationship of k=n/m and where k is a positive integer greater than 1, k>1, which GF(2 m ) Galois multiplication gate means generates k 2 subfield GF(2 m ) Galois partial products; X input means for receiving said n-bit X input and for sequentially coupling m-bit portions of said n-bit X input to said GF(2 m ) Galois multiplication gate means; Y input means for receiving said n-bit Y input and for sequentially coupling m-bit portions of said n-bit Y input to said GF(2 m ) Galois multtiplication gate means; X m ·Y means for receiving and storing said k 2 subfield GF(2 m ) Galois partial products from said GF(2 m ) multiplication gate means; ·t d constant multiplier means receiving said k 2 subfield GF(2 m ) Galois partial products from said X m ·Y m means for performing the appropriate constant multiply for each of said k 2 subfield GF(2 m ) Galois partial products; Galois sum means for receiving the output of said ·t d constant multiplier means; output means for receiving and storing the output of said Galois sum means; and, multiplexer means sequentially coupling the contents of said output means to said Galois sum means for sequentially enabling said Galois sum means to perform the Galois sum of the output of said ·t d constant multiplier means and said output means for each of said k 2 subfield GF(2 m ) Galois partial products and generating in said output means said Galois product X·Y.
Claim 14
Dependent Claim 51 words
The Galois GF(2 n ) multiplication gate of claim 8 further including ·t d Select means coupled to said ·t d constant multiplier means for enabling said ·t d constant multiplier means to select the appropriate constant multiply for each of said k 2 subfield GF(2 m ) Galois partial products.
Claim 15
Dependent Claim 253 words
A Galois GF(2 n ) linear gate for performing the Galois linear operation in the Galois field GF(2 n ) which Galois GF(2 n ) linear gate generates the Galois linear resultant X·Y+Z=(X·Y+Z) 0 , . . . , (X·Y+Z) n-1 from the Galois input on n, X input lines X.sub.0, . . . , X.sub.n-1 from the Galois input on n, Y input lines Y.sub.0, . . . , Y.sub.n-1 and from the Galois input on n, Z input lines Z.sub.0, . . . , Z.sub.n-1 comprising: a single GF(2 m ) Galois multiplication gate having the Galois subfield GF(2 m ), where m is a positive integral divisor of n having the relationship of k=n/m and where k is a positive integer greater than 1, k>1, which single GF(2 m ) Galois multiplication gate generates k 2 subfield GF(2 m ) Galois partial products; input sequencer means receiving said X and Y n-bit inputs and sequential coupling k m-bit portions of each of said X and Y n-bit inputs to said single GF(2 m ) Galois multiplication gate for enabling said single GF(2 m ) Galois multiplication gate to sequentially generate said k 2 subfield GF(2 m ) Galois partial products therefrom; and, means, including constant multiplier means, responsively coupled to said single GF(2 m ) Galois multiplication gate and to said Z n-bit inputs for sequentially accumulating said sequentially generated k 2 subfield GF(2 m ) partial products and providing on n output lines the n-bit Galois linear resultant X·Y+Z.
Claim 16
Dependent Claim 253 words
A Galois GF(2 n ) linear gate for performing the Galois linear operation in the Galois field GF(2 n ) which Galois GF(2 n ) linear gate generates the Galois linear resultant X·Y+Z=(X·Y+Z) 0 , . . . , (X·Y+Z) n-1 from the Galois input on n, X input lines X.sub.0, . . . , X.sub.n-1 from the Galois input on n, Y input lines Y.sub.0, . . . , Y.sub.n-1 and from the Galois input on n, Z input lines Z.sub.0, . . . , Z.sub.n-1 comprising: a single GF(2 m ) Galois multiplication gate having the Galois subfield GF(2 m ), where m is a positive integral divisor of n having the relationship of k=n/m and where k is a positive integer greater than 1, k>1, which single GF(2 m ) Galois multiplication gate generates k 2 subfield GF(2 m ) Galois partial products; input sequencer means receiving said X and Y n-bit inputs and sequential coupling k m-bit portions of each of said X and Y n-bit inputs to said single GF(2 m ) Galois multiplication gate for enabling said single GF(2 m ) Galois multiplication gate to sequentially generate said k 2 subfield GF(2 m ) Galois partial products therefrom; and, means, including constant multiplier means, responsively coupled to said single GF(2 m ) Galois multiplication gate and to said Z n-bit inputs for sequentially accumulating said sequentially generated k 2 subfield GF(2 m ) partial products and providing on n output lines the n-bit Galois linear resultant X·Y+Z.
Claim 17
Dependent Claim 428 words
A Galois GF(2 n ) linear gate for performing the Galois linear operation in the Galois field GF(2 n ) which Galois GF(2 n ) linear gate generates the Galois linear resultant X·Y+Z=(X·Y+Z) 0 , . . . , (X·Y+Z) n-1 from the Galois input on n, X input lines X.sub.0, . . . , X.sub.n-1 from the Galois input on n, Y input lines Y.sub.0, . . . , Y.sub.n-1 and from the Galois input on n, Z input lines Z.sub.0, . . . , Z.sub.n-1 comprising: GF(2 m ) Galois multiplication gate means having the Galois subfield GF(2 m ), where m is a positive integral divisor of n having the relationship of k=n/m and where k is a positive integer greater than 1, k>1, which GF(2 m ) Galois multiplication gate means generates k 2 subfield GF(2 m ) Galois partial products; X input means for receiving said n-bit X input and for sequentially coupling m-bit portions of said n-bit X input to said GF(2 m ) Galois multiplication gate means; Y input means for receiving said n-bit Y input and for sequentially coupling m-bit portions of said n-bit Y input to said GF(2 m ) Galois multiplication gate means; X m ·Y m means for receiving and storing said k 2 subfield GF(2 m ) Galois partial products from said GF(2 m ) multiplication gate means; Z input means for receiving said n-bit Z input and for sequentially coupling m-bit portions of said n-bit Z input to said X m ·Y m means; said X m ·Y m means forming k 2 subfield GF(2 m ) Galois partial resultants from said k 2 subfield GF(2 m ) Galois partial products and said m-bit portions of said n-bit Z input; ·t d constant multiplier means receiving said k 2 subfield GF(2 n ) Galois partial resultants from said X m ·Y m means for performing the appropriate constant multiply for each of said k 2 subfield GF(2 m ) Galois partial resultants; Galois sum means for receiving the output of said ·t d constant multiplier means; output means for receiving and storing the output of said Galois sum means; and, multiplexer means sequentially coupling the contents of said output means to said Galois sum means for sequentially enabling said Galois sum means to perform the Galois sum of the output of said ·t d constant multiplier means and said output means for each of said k 2 subfield GF(2 m ) Galois partial resultants and generating in said output means said Galois linear resultant X·Y+Z.
Claim 18
Dependent Claim 428 words
A Galois GF(2 n ) linear gate for performing the Galois linear operation in the Galois field GF(2 n ) which Galois GF(2 n ) linear gate generates the Galois linear resultant X·Y+Z=(X·Y+Z) 0 , . . . , (X·Y+Z) n-1 from the Galois input on n, X input lines X.sub.0, . . . , X.sub.n-1 from the Galois input on n, Y input lines Y.sub.0, . . . , Y.sub.n-1 and from the Galois input on n, Z input lines Z.sub.0, . . . , Z.sub.n-1 comprising: GF(2 m ) Galois multiplication gate means having the Galois subfield GF(2 m ), where m is a positive integral divisor of n having the relationship of k=n/m and where k is a positive integer greater than 1, k>1, which GF(2 m ) Galois multiplication gate means generates k 2 subfield GF(2 m ) Galois partial products; X input means for receiving said n-bit X input and for sequentially coupling m-bit portions of said n-bit X input to said GF(2 m ) Galois multiplication gate means; Y input means for receiving said n-bit Y input and for sequentially coupling m-bit portions of said n-bit Y input to said GF(2 m ) Galois multiplication gate means; X m ·Y m means for receiving and storing said k 2 subfield GF(2 m ) Galois partial products from said GF(2 m ) multiplication gate means; Z input means for receiving said n-bit Z input and for sequentially coupling m-bit portions of said n-bit Z input to said X m ·Y m means; said X m ·Y m means forming k 2 subfield GF(2 m ) Galois partial resultants from said k 2 subfield GF(2 m ) Galois partial products and said m-bit portions of said n-bit Z input; ·t d constant multiplier means receiving said k 2 subfield GF(2 n ) Galois partial resultants from said X m ·Y m means for performing the appropriate constant multiply for each of said k 2 subfield GF(2 m ) Galois partial resultants; Galois sum means for receiving the output of said ·t d constant multiplier means; output means for receiving and storing the output of said Galois sum means; and, multiplexer means sequentially coupling the contents of said output means to said Galois sum means for sequentially enabling said Galois sum means to perform the Galois sum of the output of said ·t d constant multiplier means and said output means for each of said k 2 subfield GF(2 m ) Galois partial resultants and generating in said output means said Galois linear resultant X·Y+Z.

References Cited (Backward Citations)

US3805037A Cited
US4037093A Cited
US4162480A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1984-02-17 1984-08-18 1985-02-17 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1988-02-17 1988-08-18 1989-02-17 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1992-02-17 1992-08-18 1993-02-17 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag