Practical Fault Countermeasures for Chinese Remaindering Based RSA (Extended Abstract)
by
Mathieu Ciet
,
Marc Joye
| Venue: | IN PROC. FDTC’05 |
| Citations: | 5 - 0 self |
BibTeX
@INPROCEEDINGS{Ciet_practicalfault,
author = {Mathieu Ciet and Marc Joye},
title = {Practical Fault Countermeasures for Chinese Remaindering Based RSA (Extended Abstract)},
booktitle = {IN PROC. FDTC’05},
year = {},
pages = {124--131},
publisher = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Most implementations of the widely-used RSA cryptosystem rely on Chinese remaindering (CRT) as this greatly improves the performances in both running times and memory requirements. Unfortunately, CRT-based implementations are also known to be more sensitive to fault attacks: a single fault in an RSA exponentiation may reveal the secret prime factors trough a GCD computation, that is, a total breaking. This paper
