Sequential Galois multiplication in GF(2.sup.n) with GF(2.sup.m)

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

364736, G06F 752, G06F 738

Patent

active

042518750

ABSTRACT:
Configurations of Boolean elements for implementing a sequential GF(2.sup.n) Galois multiplication gate are disclosed. Each configuration includes a single subfield GF(2.sup.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.sup.n) Galois linear module as described in the J. T. Ellison Pat. No. 3,805,037 wherein the controls of the sequential GF(2.sup.n) multiply gate cause the Galois addition (bit-wise Exclusive-OR) of an n-bit binary vector, Z, to the final Galois product.

REFERENCES:
patent: 3805037 (1974-04-01), Ellison
patent: 4037093 (1977-07-01), Gregg et al.
patent: 4162480 (1979-07-01), Berlekamp
Law, Jr. et al., "A Cellular-Array Multiplier For GF(2.sup.m)", IEEE Trans. on Computers, vol. C-20, No. 12, Dec. 1971, pp. 1573-1578.
Ellison, "Galois Logic Design", Data Sciences Laboratory, AFCRL-70-0583, Oct. 1970, pp. 1-159.
Marver, "Squential Galois Multipliers", Office of Naval Research, PX 12344, Aug. 1977, pp. 1-14.
Marver et al., "Complexity Reduction in Galois Logic Design", Office of Naval Research, PX 12461, Dec. 1977, pp. 1-1-A-2.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Sequential Galois multiplication in GF(2.sup.n) with GF(2.sup.m) does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Sequential Galois multiplication in GF(2.sup.n) with GF(2.sup.m), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sequential Galois multiplication in GF(2.sup.n) with GF(2.sup.m) will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2265664

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.