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

  • Authors:
  • Johannes Blömer;Martin Otto

  • Affiliations:
  • Institute for Computer Science, Paderborn University, Paderborn, Germany;Corporate Technology CT IC3, Siemens AG, Munich, Germany

  • Venue:
  • FDTC'06 Proceedings of the Third international conference on Fault Diagnosis and Tolerance in Cryptography
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.