Wagner's attack on a secure CRT-RSA algorithm reconsidered

19Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

At CCS 2003, a new CRT-RSA algorithm was presented in [BOS03], which was claimed to be secure against fault attacks for various fault models. At CCS 2004, David Wagner presented an attack on the proposed scheme, claiming that the so-called BOS scheme was insecure for all presented fault models [Wag04]. However, the attack itself contains a flaw which shows that although the BOS scheme is broken in some fault models, it is not broken in the most realistic "random fault model". This paper points out the flaw in the attack on the BOS scheme, aiming to clarify this issue. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Blömer, J., & Otto, M. (2006). Wagner’s attack on a secure CRT-RSA algorithm reconsidered. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4236 LNCS, pp. 13–23). Springer Verlag. https://doi.org/10.1007/11889700_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free