Timing Attack on Fast Implementation Algorithm of RSA
Qiang Zhao · Jisuanji gongcheng · 2007
This paper presents an improved method for timing attack. It can attack the fast implementation of RSA, including Montgomery ex-ponentiation algorithm and Chinese remainder theorem. It gets the relationship between the input parameters and execution time of RSA by analyzing the probability of extra reduction during Montgomery exponentiation operation, and gets the secret factors bit by bit by timing analyzing with the chosen input ciphertexts, and exposes the factorization of RSA.