Device and method for modular multiplication
AssigneeSamsung Electronics Co., Ltd.
InventorYong-Jin Jeong
Life of this patent
Estimating the term…
Loading patent…
AssigneeSamsung Electronics Co., Ltd.
InventorYong-Jin Jeong
Estimating the term…
A method and apparatus are disclosed for performing modular multiplication. Modular multiplication in accordance with the present invention includes precalculating a 2's complement of a given modulus and multiples of the 2's complement and calculating a total magnitude of end-around carries during the modular multiplication. The calculated multiples are selected depending on the total magnitude of the end-around carries, and the selected multiples are added. The disclosure includes array structures in accordance with the present invention. The invention includes an algorithm designed for Rivest-Shamir-Adelman (RSA) cryptography and based on the familiar iterative Homer's rule, but uses precalculated complements of the modulus. The problem of deciding which multiples of the modulus to subtract in intermediate iteration stages has been simplified using simple look-up of precalculated complement numbers, thus allowing a finer-grain pipeline. Regularity and local connections make the algorithm suitable for high-performance array implementation in FPGA's (field programmable gate arrays) or deep submicron VLSI's.
A method for performing modular multiplication, comprising the steps of:
A device for performing modular multiplication, comprising:
An array structure for iteration stages of a modular multiplier, comprising:
An array structure for iteration stages of a modular multiplier, comprising:
Dependencies are inferred from the claim text.