Sequential galois field multiplication architecture and method
OwnerChih-Hsu Yeninventor
Life of this patent
Estimating the term…
Abstract
A sequential Galois field (GF) multiplication architecture based on Mastrovito's multiplication and composite field has a two-tier architecture for performing GF(2k) multiplication. The tier one prepares related data of an operand A at one time, and proceeds another operand B by sequentially inputting m n-bit data, where k=m×n. The tier two sequentially receives the m inputted n-bit data, and directly performs GF((2n)m) multiplication with m n-bit multipliers. Before the data processing of the first architecture, operands A and B are transformed from a field GF(2k) into a composite field GF((2n)m) While a multiplication result from the tier two is transformed from the composite field GF((2n)m) back to the field GF(2k) for completing the GF(2k) multiplication.
Claims13
A sequential Galois Field (GF) multiplication architecture, for performing a GF(2k) multiplication on operands A and B, k being an positive integer, said multiplication architecture comprising:
- a first tier, for preparing data of operand A in entirety and proceeding data of operand B by sequentially inputting m n-bit data, k=m×n, m and n being positive integers;
- and a second tier, for sequentially receiving data of operand B and using m n-bit multipliers to realize GF((2n)m) multiplication;
- wherein before said first tier architecture processing, said operands A and B are mapped from a field GF(2k) to a composite field GF((2n)m), and a multiplication result from said second tier is mapped back to said GF(2k) to accomplish said GF(2k) multiplication.
A sequential Galois Field (GF) multiplication method, for performing a GF(2k) multiplication, said method comprising:
- mapping operands A and B from a field GF(2k) to a composite field GF((2n)m), k=mn, k, m and n being positive integers;
- using a first tier to prepare data of operand A in entirety and proceed data of operand B by sequentially inputting m n-bit data;
- using a second tier to sequentially receive data of operand B and using m n-bit multipliers to realize GF((2n)m) multiplication;
- and
- mapping a multiplication result from said second tier back to said GF(2k) to accomplish said GF(2k) multiplication.
Dependencies are inferred from the claim text.