| 摘要 |
<p>The method involves defining a cryptographic calculation by a preset sequence of operations, where the sequence contains a modular addition, modular subtraction, and a Montgomery multiplication with a preset modulus. The Montgomery multiplication is executed after the modular addition and the modular subtraction. The calculation is acceleratedly executed by replacing the modular addition by simple addition and the modular subtraction by simple subtraction during execution of the calculation. The multiplication is executed by a Rivest-Shamir-Adleman (RSA) Montgomery crypto-coprocessor.</p> |
