Comparative Power Analysis of Modular Exponentiation Algorithms

Comparative Power Analysis of Modular Exponentiation Algorithms,10.1109/TC.2009.176,IEEE Transactions on Computers,Naofumi Homma,Atsushi Miyamoto,Taka

Comparative Power Analysis of Modular Exponentiation Algorithms   (Citations: 2)
BibTex | RIS | RefWorks Download
This paper proposes new chosen-message power-analysis attacks for public-key cryptosystems based on modular exponentiation, where specific input pairs are used to generate collisions between squaring operations at different locations in the two power traces. Unlike previous attacks of this kind, the new attack can be applied to all standard implementations of the exponentiation process, namely binary (left-to-right and right-to-left), m-ary, and sliding window methods. The proposed attack can also circumvent typical countermeasures, such as the Montgomery powering ladder and the double-add algorithm. The effectiveness of the attack is demonstrated in experiments with hardware and software implementations of RSA on an FPGA and a PowerPC processor, respectively. In addition to the new collision generation methods, a highly accurate waveform matching technique is introduced for detecting the collisions even when the recorded signals are noisy and there is a certain amount of clock jitter.
Journal: IEEE Transactions on Computers - TC , vol. 59, no. 6, pp. 795-807, 2010
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: