| 摘要 |
PROBLEM TO BE SOLVED: To verify a fault attach countermeasure against a discretionary public key e in a time equal to one session of exponential remainder.SOLUTION: In an exponential remainder arithmetic expressed by Y=XmodN, calculation is made of C0=XmodN, C1=XmodN, and T=XmodN, where d' represents the 2's complement of d and n represents the number of bits of d, determination is made as to whether a remainder where N is a divisor for the product of the value of C0 and the value of C1 matches the value of T, and, when it matches, the value of C1 is made to be Y, and, when it does not match, an error is assumed. This exponential remainder arithmetic is applied to an exponential remainder arithmetic in the cases where RSA decoding is performed using a Chinese remainder theorem. |
