Modular Reduction for Cryptographic Operations
OwnerWieland Fischerinventor
Life of this patent
Estimating the term…
Loading patent…
OwnerWieland Fischerinventor
Estimating the term…
Performing a modular reduction of an input number C modulo of a modulus N. An example method comprises: (i) calculating an intermediate value q, from which a quotient of the input number C divided by the modulus N is approximated, (ii) extracting a number Q for a reduction operation C−Q·N from the intermediate value q, (iii) extracting information from the intermediate value q, wherein on the basis of the information already before performing the reduction operation C−Q·N it is possible to determine whether a final reduction is to be performed, (iv) performing the reduction operation C−Q·N, and (v) depending on the information, performing the final reduction or not performing the final reduction.
A device for performing a modular reduction of an input number C modulo of a modulus N, wherein the device comprises a processing unit, the processing unit comprising processing circuitry and memory, the processing unit being configured to:
A method for performing a modular reduction of an input number C modulo of a modulus N, comprising the steps of:
Dependencies are inferred from the claim text.