Cryptanalysis of a provably secure CRT-RSA algorithm

  • Authors:
  • David Wagner

  • Affiliations:
  • University of California at Berkeley

  • Venue:
  • Proceedings of the 11th ACM conference on Computer and communications security
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study a countermeasure proposed to protect Chinese remainder theorem (CRT) computations for RSA against fault attacks. The scheme was claimed to be provably secure. However, we demonstrate that the proposal is in fact insecure: it can be broken with a simple and practical fault attack. We conclude that the proposed countermeasure is not safe for use in its present form.