An I-cache Attack Method on RSA Implementation
Chen Cai-sen · Microelectronics & Computer · 2009
The paper targets at the decryption/signing processes of RSA cryptosystem implemented via OpenSSL0.9.8e,chooses the extra reduction steps(ERs)in Montgomery Modular Multiplication Algorithm during the entire execution of RSA as the breakthrough entry,bases on the theoretical foundation that the ERs will be changed as the difference of the secret key bits,prefers to use I-cache analysis as our tool to detect the occurrences of ERs,and finally recovers the original key.The aim of this paper is to prove the practicality of the I-cache analysis when it is used to attack RSA implementations.