Back to results
US 12,732,365 B1Granted
Adding scalar blinding in elliptic curve cryptography
AssigneeSynopsys, Inc.
InventorsA. A. Jithra Adikari, Rudolphus J. C. Derwig
Life of this patent
Estimating the term…
Abstract
A method of performing elliptic curve cryptography includes, in part, receiving a scalar k representative of a secret key; and splitting, by a processing device, a multiplication of k by a generator point P on the elliptic curve ([k]P) into a sum of a first multiplication defined by [k−r]P, and a second multiplication defined by [r/n](nP), where n is a power of 2 of an integer number, and r is an integer smaller than k/(2*n); i.e., r<k(/2*n).
Claims20
A method of performing elliptic curve cryptography comprising:
- receiving a scalar k representative of a secret key;
- and
- splitting, by a processing device, a multiplication of k by a generator point P on the elliptic curve ([k]P) into a sum of a first multiplication defined by [k−r]P, and a second multiplication defined by [r/n](nP), where n is a power of 2 of an integer number, and r is an integer smaller than k/(2*n), so as to enhance computation speed associated with performing the elliptic curve cryptography.
A system comprising hardware state machine configured to:
- receive a scalar k representative of a secret key;
- and
- split and a multiplication of k by a generator point P on the elliptic curve ([k]P) into a sum of a first multiplication defined by [k−r]P, and a second multiplication defined by [r/n](nP), where n is a power of 2 of an integer number, and r is an integer smaller than k/(2*n), so as to enhance computation speed associated with performing an elliptic curve cryptography.
A system comprising:
- a memory storing instructions;
- and
- a processor, coupled with the memory and configured to execute the instructions, the instructions when executed causing the processor to:
- receive a scalar k representative of a secret key;
- and
- split and a multiplication of k by a generator point P on the elliptic curve ([k]P) into a sum of a first multiplication defined by [k−r]P, and a second multiplication defined by [r/n](nP), where n is a power of 2 of an integer number, and r is an integer smaller than k/(2*n), so as to enhance computation speed associated with performing an elliptic curve cryptography.
3 more elements
Dependencies are inferred from the claim text.