A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Clustering Collision Power Attack on RSA-CRT
Computer systems science and engineering
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 d p and d q are segmented by byte, and the modular multiplication collisions are identified by k-means clustering. The exponents d p and d q were recovered by 12 power traces of six groups of thedoi:10.32604/csse.2021.014460 fatcat:7ixy7ckffvfafkap4663rptnka