Method and apparatus for finite field multiplication
US6049815A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Dec 24, 1997 |
| Grant date | Apr 11, 2000 |
| Priority date | — |
| Expiry date | Dec 24, 2017 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F7/724
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method of computing the product D of two finite field elements B and C modulo an irreducible polynomial f.sub.1 (x), wherein the finite field elements B and C are represented in terms of an optimal normal basis (ONB) of Type 1 over a field F.sub.2.spsb.n and the irreducible polynomial f.sub.1 (x) being of degree n, which comprises the steps of representing the element B as a vector of binary digits b.sub.i, where b.sub.i is a co-efficient of an i.sup.th basis element of the ONB representation of element B, in polynomial order, representing the element C as a vector of binary digits c.sub.i, where c.sub.i is a co-efficient of an i.sup.th basis element of the ONB representation of element C, arranged in polynomial order, initializing a register A, selecting a digit c.sub.i of the vector C, computing a partial product vector A of the i.sup.th digit c.sub.i of the element C and the vector B, adding the partial product to the register A, shifting the register A, reducing the partial product A by a multiple f.sub.2 (x) of the irreducible polynomial f.sub.1 (x) if bits in a position above n are set, storing the reduced partial product in the register A, repeating for each successive bit…
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.