Back to results
US 8,804,951 B2Granted
Speeding up galois counter mode (GCM) computations
AssigneeIntel Corporation
InventorsShay Gueron, Michael E. Kounavis
Life of this patent
Estimating the term…
Abstract
Methods and apparatus to speed up Galois Counter Mode (GCM) computations are described. In one embodiment, a carry-less multiplication instruction may be used to perform operations corresponding to verification of an encrypted message in accordance with GCM. Other embodiments are also described.
Claims20
A method comprising:
- multiplying, at a processor, a most significant portion of a product of a carry-less multiplication with a first value to generate a second value;
- multiplying, at the processor, a most significant portion of the second value with a least significant portion of an irreducible polynomial of a final field used in a block cipher to generate a third value;
- and
- determining, at the processor, whether a remainder exists based on the third value, wherein non-existence of the remainder is to indicate that an encrypted message is authentic in accordance with Galois Counter Mode (GCM).
1 more element
A non-transitory computer-readable medium comprising one or more instructions that when executed on a processor configure the processor to:
- multiply a most significant portion of a product of a carry-less multiplication with a first value to generate a second value;
- and
- multiply a most significant portion of the second value with a least significant portion of an irreducible polynomial of a final field used in a block cipher to generate a third value;
- determine whether a remainder exists based on the third value, wherein non-existence of the remainder is to indicate that an encrypted message is authentic in accordance with Galois Counter Mode (GCM).
1 more element
A system comprising:
- memory to store a carry-less multiplication instruction;
- and
- a processor to execute the carry-less multiplication instruction to determine whether an encrypted message is authentic, wherein existence of a remainder is to be determined based on multiplying a most significant portion of a product of a carry-less multiplication with a first value to generate a second value and multiplying a most significant portion of the second value with a least significant portion of an irreducible polynomial of a final field used in a block cipher, wherein non-existence of the remainder is to indicate that the encrypted message is authentic in accordance with Galois Counter Mode (GCM).
Dependencies are inferred from the claim text.