摘要 |
Deterring side channel attacks on cryptographic computations using an exponent value e and a modulus value n to determine a result value may be accomplished by picking a first value, picking a second value, computing a third value as a product of the first and second values mod n, computing a first intermediate value as the first value to the exponent e mod n, computing a second intermediate value as the second value to the exponent e mod n, and computing a result value equal to the third value to the exponent e mod n as the product of the first intermediate value and the second intermediate value mod n. The result value y<SUP>e </SUP>mod n may be determined in this manner without using a modular inverse operation.
|