×

Method and apparatus for finite field multiplication

  • US 6,049,815 A
  • Filed: 12/24/1997
  • Issued: 04/11/2000
  • Est. Priority Date: 12/30/1996
  • Status: Expired due to Term
First Claim
Patent Images

1. A computer system for determining the product of two finite field elements B and C modulo an irreducible polynomial f1 (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 F2.spsb.n and said irreducible polynomial f1 (x) being of degree n, comprising:

  • (a) a memory containing a first vector of binary digits bi, where bi is a co-efficient of the ith basis element of said ONB representation of element B, arranged in polynomial order;

    a second vector of binary digits ci, where ci is a co-efficient the ith basis element of said ONB representation of element C, arranged in polynomial order;

    a computer program having functions for invocation, said functions for computing a partial product of a multiplier with a multiplicand and for reducing said partial product by a multiple of said irreducible polynomials f1 (x);

    (b) a control program for invoking said functions; and

    (c) a processor for running said computer program.

View all claims
  • 4 Assignments
Timeline View
Assignment View
    ×
    ×