×

Efficient method for multiplication over galois fields

  • US 7,003,106 B2
  • Filed: 12/04/2001
  • Issued: 02/21/2006
  • Est. Priority Date: 08/04/2000
  • Status: Active Grant
First Claim
Patent Images

1. An improved method for encryption implemented via hardware circuit(s) including multiplication over a finite field, the improvement comprising:

  • obtaining the result of multiplication over a finite field using a primitive power and log table comprising 2 rows, wherein obtaining the result of multiplication over the finite field comprises obtaining the result of multiplication over a Galois field(28) performed in the MixColumns transformation and in the InvMixColumns transformation of the AES algorithm using a 2 by 256 primitive power and log table, comprising the steps of;

    looking up logs of terms being multiplied over the Galois field(28);

    summing the logs to obtain a sum; and

    looking up the anti-log of the sum.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×