Clustering Collision Power Attack on RSA-CRT |
| |
Authors: | Wunan Wan Jun Chen Jinyue Xia Jinquan Zhang Shibin Zhang Hao Chen |
| |
Affiliation: | 1 School of Cybersecurity, Chengdu University of Information Technology, Chengdu, 610225, China2 International Business Machines Corporation (IBM), New York, 10041 NY 212, USA |
| |
Abstract: | In this paper, we propose two new attack algorithms on RSA implementations with CRT (Chinese remainder theorem). To improve the attack efficiency considerably, a clustering collision power attack on RSA with CRT is introduced via chosen-message pairs. This attack method is that the key parameters dp and dq are segmented by byte, and the modular multiplication collisions are identified by k-means clustering. The exponents dp and dq were recovered by 12 power traces of six groups of the specific message pairs, and the exponent d was obtained. We also propose a second order clustering collision power analysis attack against RSA implementation with CRT, which applies double blinding exponentiation. To reduce noise and artificial participation, we analyze the power points of interest by preprocessing and k-means clustering with horizontal correlation collisions. Thus, we recovered approximately 91% of the secret exponents manipulated with a single power curve on RSA-CRT with countermeasures of double blinding methods. |
| |
Keywords: | Collision attack power analysis attack chosen-message attack module exponentiation RSA-CRT |
|
| 点击此处可从《计算机系统科学与工程》浏览原始摘要信息 |
|
点击此处可从《计算机系统科学与工程》下载全文 |
|