Reduction calculations
AssigneeKoninklijke Philips Electronics N.V.
InventorGerardus Hubert
Life of this patent
Estimating the term…
Abstract
An Elliptic Curve Cryptography reduction technique utilises a prime number having a first section of Most Significant Word “1” states, with N=nm−1+N1B+n0.
Claims33
A method of performing a reduction operation in a cryptographic calculation, the method comprising selecting a modulus having a first section with a plurality of “1” Most significant Word states and a second section which comprises a, plurality of “1” or “0” states whereby the number formed of the two sections is a modulus or a multiple of a modulus, and operating a reduction operation on the modulus/multiple.
Apparatus for performing a reduction operation in a cryptographic calculation, the apparatus comprising means to select a modulus or a multiple of a modulus having a first section with a plurality of “1” states and a second section having a plurality of “1” or “0” states whereby the number formed of the two sections is a modulus or a multiple of a modulus, and means for operating a reduction operation on the modulus/multiple.
A method of performing a reduction operation substantially as hereinbefore described with reference to, and/or as illustrated in, anyone or more of FIGS. 1 to 5 of the accompanying drawings.
Apparatus for performing a reduction operation in a cryptographic calculation, the apparatus substantially as hereinbefore described with reference to, and/or as illustrated in, anyone or more of FIGS. 1 to 5 of the accompanying drawings.
A method of performing a reduction operation in a cryptographic calculation, the method substantially as hereinbefore described with reference to, and/or as illustrated in, anyone or more of FIGS. 1 to 5 of the accompanying drawings.
Dependencies are inferred from the claim text.