Researching on timing attack at the accelerating implementation algorithm of RSA
Wenxue Tan · Journal of Hunan University of Science & Technology · 2009
In order to study time-related security of the algorithm of RSA,crypto processing speed of which being speeded up by using Montgomery modular exponentiation ,Chinese Remainder Theorem and some other algorithms aiming at adapting to computer environment with weak computing capability.The probability of extra reductions was analyzed in the algorithm of the Montgomery modular exponentiation and the relationship was also disccused between the running time and its input parameters,while it proposed an improved timing attack method of searching bit by bit,and chosen some cipher-text input,and compared the difference of time-consuming,and searched RSA secret factor by-bit,at last did some experiments in the platform of shen-teng 1800 ,a high-performance cluster of computing.Studies showed that although the improved RSA algorithm is better immune to conventional the timing attack,theoretically,the method of searching by bit find the prime factor RSA,which as secret parameters of RSA.1fig.,2tabs.,8refs.