Research on relationship between CRT-Mont additional reduction accelerating RSA and its timing
Meisen Pan · Jisuanji gongcheng yu sheji · 2010
To analyze immunity of the accelerated RSA algorithm’s realization based on both Montgomery Multiplication and Chinese Remainder Theorem in the environment of computing devices with a weak computability because of the existence of additional reduction against the timing attack methods, and of building its anti-attack capability, we research on the additional reduction of the mathematical characteristics of the distribution and the occurrence probability, which taking place in the course of Montgomery modular exponentiation operations , and study on the numeric characteristics-associated of additional reduction and its time-consuming properties, and propose some the related concepts, assumptions , and do some targeted experiments to analyze RSA’immunity against the timing attack quantitatively. The results show that the distribution of the additional reduction is not a simple monotonic trend, which with a mean stability of stochastic, that additional reduction of the quantity and time-consuming keep a similar trend, and that the introduction of a random factor is enable to give RSA better immunity to the timing attack.