Back to results
US 12,562,885 B2Granted
Methods and IP cores for reducing vulnerability to hardware attacks and/or improving processor performance
AssigneeFortifyiq, Inc.
InventorsUry Kreimer, Alexander Kesler, Yaacov Belenky, Vadim Bugaenko
Life of this patent
Estimating the term…
Abstract
In a general aspect, a GHASH semiconductor intellectual property (IP) core can include circuitry for calculating a GHASH function. The IP core can be configured to calculate the GHASH function by calculating the following quantities: X 0 = 0 ; X i + 1 = H k X i + ∑ j = 0 k - 1 ∑ n = 0 m - 1 C ki + j h ijn , where for any i and j; and ∑ n = 0 m - 1 h i j n = H j , where k > 1 and m > 1 .
Claims22
An AES GCM semiconductor intellectual property (IP) core comprising:
- circuitry for calculating a GHASH function, the calculating including:
- assigning X0 as a 128-bit sequence 0128;
- computing the GHASH function, the computing including iteratively calculating:
- X
- i
- +
- 1
- =
- H
- k
-
- X
- i
- +
- ∑
- j
- =
- 0
- k
- -
- 1
- ∑
- n
- =
- 0
- m
- -
- 1
- C
- ki
- +
- j
-
- h
- ijn
- wherein for any i and any j:
- ∑
- n
- =
- 0
- m
- -
- 1
- h
- ijn
- =
- H
- q
- wherein q is a function of j,
- and wherein i, k and m are respective natural numbers, H is a 128-bit value, C is a bit string of a size that is divisible by 128, values of hijn are respective 128-bit values, k>1, and m>1;
- and
- circuitry for generating an AES GCM block protected against side-channel attacks in which an attacker discovers a key.
49 more elements
A method comprising:
- using a data processor to calculate a GHASH function, the calculating including:
- assigning X0 as a 128-bit sequence 0128;
- computing the GHASH function, including iteratively calculating:
- X
- i
- +
- 1
- =
- H
- k
-
- X
- i
- +
- ∑
- j
- =
- 0
- k
- -
- 1
- ∑
- n
- =
- 0
- m
- -
- 1
- C
- ki
- +
- j
-
- h
- ijn
- wherein for any i and any j:
- ∑
- n
- =
- 0
- m
- -
- 1
- h
- ijn
- =
- H
- q
- wherein q is a function of j,
- and wherein i, k and m are respective natural numbers, His a 128-bit value, C is a bit string of a size that is divisible by 128, values of hijn are respective 128-bit values, k>1 and m>1;
- and
- generating an AES GCM block protected against side-channel attacks in which an attacker discovers a key.
49 more elements
Dependencies are inferred from the claim text.