Paper 2014/869 Original: eprint.iacr.org/2014/869 ↗
Exclusive Exponent Blinding May Not Suffice to Prevent Timing Attacks on RSA
Abstract
The references [9,3,1] treat timing attacks on RSA with CRT and Montgomery's multiplication algorithm in unprotected implementations. It has been widely believed that exponent blinding would prevent any timing attack on RSA. At cost of significantly more timing measurements this paper extends the before-mentioned attacks to RSA with CRT when Montgomery's multiplication algorithm and exponent blinding are applied. Simulation experiments are conducted, which confirm the theoretical results. Effective countermeasures exist. In particular, the attack efficiency is higher than in the previous version [12] while large parts of both papers coincide.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2015-08-01: last updated
- 2014-10-22: published
- Short URL
- https://ia.cr/2014/869
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2014/869,
author = {Werner Schindler},
title = {Exclusive Exponent Blinding May Not Suffice to Prevent Timing Attacks on RSA},
howpublished = {Cryptology {ePrint} Archive, Paper 2014/869},
year = {2014},
url = {https://eprint.iacr.org/2014/869}
}