Circuit for the inner or scalar product computation in Galois fields
First Claim
1. A circuit for use in a cryptosystem for computing a scalar product of a plurality of vectors in a finite Galois field identified by a generator polynomial, each vector including at least a first and a second element belonging to the finite Galois field, the circuit comprising:
- at least one input register for storing a plurality of digital signals representative of the first element of each of the plurality of vectors;
at least one look-up table for storing a plurality of digital words representing a plurality of combinations and reductions of the first and second elements of the plurality of vectors, each of the plurality of digital words being a function of the second elements of the plurality of vectors and the generator polynomial, the at least one look-up table cooperating with said at least one input register partial product results each identified by at least one of the plurality of digital words stored in said at least one look-up table and based upon the plurality of digital signals stored in said at least one input register; and
an accumulator unit for adding the partial product results to give the scalar product of the plurality of vectors in the finite Galois field identified by the generator polynomial of the cryptosystem based upon an accumulation of the partial product results.
1 Assignment
0 Petitions
Accused Products
Abstract
A circuit for computing the inner of scalar product of two vectors in a finite Galois field defined by a generator polynomial, wherein each vector includes at least two elements belonging to said finite field, comprises one or more look-up tables storing digital words indicative of said possible combinations and said possible reductions. The digital words in question are defined as a function of the second elements of said vectors and the generator polynomial of the field. The input register(s) and the look-up table(s) are configured to co-operate in a plurality of subsequent steps to generate at each step a partial product result identified by at least one of digital word addressed in a corresponding look-up table as a function of the digital signals stored in the input register(s). The circuit also includes an accumulator unit for adding up the partial results generated at each step to give a final product result deriving from accumulation of said partial results.
33 Citations
21 Claims
-
1. A circuit for use in a cryptosystem for computing a scalar product of a plurality of vectors in a finite Galois field identified by a generator polynomial, each vector including at least a first and a second element belonging to the finite Galois field, the circuit comprising:
-
at least one input register for storing a plurality of digital signals representative of the first element of each of the plurality of vectors; at least one look-up table for storing a plurality of digital words representing a plurality of combinations and reductions of the first and second elements of the plurality of vectors, each of the plurality of digital words being a function of the second elements of the plurality of vectors and the generator polynomial, the at least one look-up table cooperating with said at least one input register partial product results each identified by at least one of the plurality of digital words stored in said at least one look-up table and based upon the plurality of digital signals stored in said at least one input register; and an accumulator unit for adding the partial product results to give the scalar product of the plurality of vectors in the finite Galois field identified by the generator polynomial of the cryptosystem based upon an accumulation of the partial product results. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
-
13. A circuit for use in a cryptosystem for computing a scalar product of a plurality of vectors in a finite Galois field identified by a generator polynomial, each vector including at least a first and a second element belonging to the finite field, the circuit comprising:
-
at least one input register for storing digital signals representative of the first element of each of the plurality of vectors; at least one look-up table for storing a plurality of digital words, each of the plurality of digital words based on the second elements of the plurality of vectors and the generator polynomial, the at least one look-up table cooperating with said at least one input register to generate at least two partial product results identified by the plurality of digital words stored in said at least one look-up table and based upon at least two digital signals stored in said at least one input register; and an accumulator unit for adding the at least two partial product results to give the scalar product of the plurality of vectors in the finite Galois field identified by the generator polynomial of the cryptosystem. - View Dependent Claims (14, 15, 16)
-
-
17. A method for computing an inner product of a plurality of vectors belonging to a set identified by a generator polynomial for use in a cryptosystem, each said vector having at least a first and a second element belonging to said set, the circuit comprising:
-
providing at least one input register for storing digital signals representative of the first element of each of the plurality of vectors; configuring at least one look-up table to store digital words based on the second elements of each of the plurality of vectors and the generator polynomial, and to cooperate with said at least one input register to generate partial product results each identified by at least one of said digital words addressed in said at least one look-up table; and summing the partial product results in an accumulator unit to give the inner product of the plurality of vectors in the finite Galois field identified by the generator polynomial of the cryptosystem deriving from accumulation of said partial results. - View Dependent Claims (18, 19, 20, 21)
-
Specification