Matrix multiplier in GF(2.sup.m)

Details Matrix multiplier in GF(2.sup.m) Matrix multiplier in GF(2.sup.m)

1975-12-29

1977-07-19

Malzahn, David H.

Registers

Transfer mechanism

Traveling pawl

G06F 752

Patent

active

040370933

ABSTRACT:
The invention comprises circuitry for systematically multiplying two arbitrary field elements in a Galois field GF(2.sup.m). Each element is represented by an m-bit binary number. The multiplicand field element is passed serially through a plurality of m-1 modulo multipliers. The multiplicand and the product from each of the m-1 modulo multipliers are passed through networks which are gated by bits of the multiplier field element forming partial products. The partial products are summed to form the bit representations of the final product.

REFERENCES:
patent: 3557356 (1971-01-01), Balza et al.
B. A. Laws, Jr. et al, "A Cellular-Array Multiplier for GF(2.sup.m)" IEEE Trans. on Computers, Dec. 1971, pp. 1573-1578.

Affiliated with

Also associated with

Rating

Matrix multiplier in 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 Matrix multiplier in GF(2.sup.m), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Matrix multiplier in GF(2.sup.m) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2294789